2012 · 33 citations · 1 references
Natural SciencesVisualizationCombinatoricsGraph AlgorithmsGraph ColoringGraph TheoryColoring Theorems
Let G=(V,E) be a connected graph and c be a proper k-coloring of G. Let Π = {C1,C2,...,C3} be a partition of V(G). Where Ci is the set of vertices receiving color i. The color code CΠ(V) of a vertex V in
1