Hierarchical Colorings of Cographs
Combinatorics
2019-06-25 v1 Discrete Mathematics
Abstract
Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors . In recent work on reciprocal best match graphs so-called hierarchically coloring play an important role. Here we show that greedy colorings are a special case of hierarchical coloring, which also require no more than colors.
Keywords
Cite
@article{arxiv.1906.10031,
title = {Hierarchical Colorings of Cographs},
author = {D. I. Valdivia and M. Geiß and M. Hellmuth and M. Hernandez Rosales and P. F. Stadler},
journal= {arXiv preprint arXiv:1906.10031},
year = {2019}
}