English

Some Mader-perfect graph classes

Combinatorics 2022-10-13 v1

Abstract

The dichromatic number of DD, denoted by χ(D)\overrightarrow{\chi}(D), is the smallest integer kk such that DD admits an acyclic kk-coloring. We use maderχ(F)mader_{\overrightarrow{\chi}}(F) to denote the smallest integer kk such that if χ(D)k\overrightarrow{\chi}(D)\ge k, then DD contains a subdivision of FF. A digraph FF is called Mader-perfect if for every subdigraph FF' of FF, maderχ(F)=V(F){\rm mader }_{\overrightarrow{\chi}}(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} {\bf 153} (2022) 1--30]. We also show that if KK is a proper subdigraph of C4\overleftrightarrow{C_4} except for the digraph obtained from C4\overleftrightarrow{C_4} by deleting an arbitrary arc, then KK is Mader-perfect.

Keywords

Cite

@article{arxiv.2210.06247,
  title  = {Some Mader-perfect graph classes},
  author = {Hui Lei and Siyan Li and Xiaopan Lian and Susu Wang},
  journal= {arXiv preprint arXiv:2210.06247},
  year   = {2022}
}

Comments

12 pages, 2 figures

R2 v1 2026-06-28T03:26:51.486Z