Hierarchical Colorings of Cographs

arXiv1906.10031MaRDI QIDQ6320971FDOQ6320971

Authors: Dulce I. Valdivia, Manuela Geiß, Marc Hellmuth, M. Hernandez Rosales, Peter F. Stadler 

Publication date: 24 June 2019

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 $chi(G)$. 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 $chi(G)$ colors.

This page was built for publication: Hierarchical Colorings of Cographs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320971)