Searching for "Connected colorings of graphs." – sorted by Relevance.
-
Random Walks on Colored Graphs
- need the following generalization of a strongly-connected directed graph. A k-colored directed graph G
- Cited by 2 (1 self) – Add To MetaCart
-
Isomorphism Testing for Embeddable Graphs Through Definability
- G i . When talking about graph theoretic notions such as connectivity in colored graphs, we always
- Cited by 11 (1 self) – Add To MetaCart

