Some mader-perfect graph classes
From MaRDI portal
Publication:6160574
Abstract: The dichromatic number of , denoted by , is the smallest integer such that admits an acyclic -coloring. We use to denote the smallest integer such that if , then contains a subdivision of . A digraph is called Mader-perfect if for every subdigraph of , . 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 is a proper subdigraph of except for the digraph obtained from by deleting an arbitrary arc, then is Mader-perfect.
Recommendations
Cites work
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Dichromatic number and forced subdivisions
- Hajos' graph-coloring conjecture: Variations and counterexamples
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Topological cliques in graphs II
- Vertices of small degree in critically n-connected digraphs
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)