Greedy colorings are a special case of hierarchical colorings in cographs, both using no more than χ(G) colors.
Recursive graphs, recursive labelings and shortest paths
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hierarchical Colorings of Cographs
Greedy colorings are a special case of hierarchical colorings in cographs, both using no more than χ(G) colors.