On the dib-chromatic number of a digraph
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914152789835776 |
|---|---|
| author | Montellano-Ballesteros, Juan José Rubio-Montiel, Christian |
| author_facet | Montellano-Ballesteros, Juan José Rubio-Montiel, Christian |
| contents | An acyclic coloring of a digraph that maximizes the number of colors such that each color class has a vertex pointing to all other classes and a vertex pointing to it from all other classes is known as the dib-chromatic number of a digraph. In this paper, we answer the question about the existence of the dib-chromatic number and study the dib-chromatic number of bipartite digraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_08807 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the dib-chromatic number of a digraph Montellano-Ballesteros, Juan José Rubio-Montiel, Christian Combinatorics 05C15, 05C20 An acyclic coloring of a digraph that maximizes the number of colors such that each color class has a vertex pointing to all other classes and a vertex pointing to it from all other classes is known as the dib-chromatic number of a digraph. In this paper, we answer the question about the existence of the dib-chromatic number and study the dib-chromatic number of bipartite digraphs. |
| title | On the dib-chromatic number of a digraph |
| topic | Combinatorics 05C15, 05C20 |
| url | https://arxiv.org/abs/2511.08807 |