Some mader-perfect graph classes

From MaRDI portal
Publication:6160574



Abstract: The dichromatic number of D, denoted by overrightarrowchi(D), is the smallest integer k such that D admits an acyclic k-coloring. We use maderoverrightarrowchi(F) to denote the smallest integer k such that if overrightarrowchi(D)gek, then D contains a subdivision of F. A digraph F is called Mader-perfect if for every subdigraph F′ of F, mmaderoverrightarrowchi(F′)=|V(F′)|. We extend octi digraphs to a larger class of digraphs and prove that it is Mader-perfect, which generalizes a result of Gishboliner, Steiner and Szab'{o} [Dichromatic number and forced subdivisions, {it J. Comb. Theory, Ser. B} {�f 153} (2022) 1--30]. We also show that if K is a proper subdigraph of overleftrightarrowC4 except for the digraph obtained from overleftrightarrowC4 by deleting an arbitrary arc, then K is Mader-perfect.












This page was built for publication: Some mader-perfect graph classes

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