The dib-chromatic number of digraphs
Combinatorics
2026-03-10 v2
Abstract
We study an extension to directed graphs of the parameter called the -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.
Cite
@article{arxiv.2411.14248,
title = {The dib-chromatic number of digraphs},
author = {Nahid Javier-Nol and Christian Rubio-Montiel and Ingrid Torres-Ramos},
journal= {arXiv preprint arXiv:2411.14248},
year = {2026}
}
Comments
10 pages, 1 figure