Coloring even-hole-free graphs with no star cutset
From MaRDI portal
Publication:6301197
Abstract: A emph{hole} is a chordless cycle of length at least . A graph is emph{even-hole-free} if it does not contain any hole of even length as an induced subgraph. In this paper, we study the class of even-hole-free graphs with no star cutset. We give the optimal upper bound for its chromatic number in terms of clique number and a polynomial-time algorithm to color any graph in this class. The latter is, in fact, a direct consequence of our proof that this class has bounded rank-width.
This page was built for publication: Coloring even-hole-free graphs with no star cutset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301197)
