The dib-chromatic number of digraphs
Abstract
We study an extension to directed graphs of the parameter called the b-chromatic number of a graph in terms of acyclic vertex colorings: the dib-chromatic number. We give general bounds for this parameter. We also show some results about tournaments and regular digraphs.
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.