Some Mader-perfect graph classes
Combinatorics
2022-10-13 v1
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} {\bf 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.
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