Finding a subset of vertices in graph

I have a graph: undirected, unweighted, no leaves, no disconnected edges or vertices. The graph is populated with vertices of 3 types: A, B, C. Let's say, I hold a vertex of type A, denoted as...