The dib-chromatic number of digraphs
Nahid Javier-Nol, Christian Rubio-Montiel, Ingrid Torres-Ramos
TL;DR
This paper introduces and analyzes the dib-chromatic number, an extension of the b-chromatic number to directed graphs, providing bounds and specific results for tournaments and regular digraphs.
Contribution
It defines the dib-chromatic number for digraphs, establishes general bounds, and presents new findings for tournaments and regular digraphs.
Findings
Established bounds for the dib-chromatic number.
Derived specific results for tournaments.
Analyzed regular digraphs.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research