Some Mader-perfect graph classes

Abstract

The dichromatic number of D, denoted by (D), is the smallest integer k such that D admits an acyclic k-coloring. We use mader(F) to denote the smallest integer k such that if (D) k, then D contains a subdivision of F. A digraph F is called Mader-perfect if for every subdigraph F' of F, mader (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, J. Comb. Theory, Ser. B 153 (2022) 1--30]. We also show that if K is a proper subdigraph of C4 except for the digraph obtained from C4 by deleting an arbitrary arc, then K is Mader-perfect.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…