Metraipolis › archive › dc_db506b8cd637
Sequence b-colorings in graphs — arXiv:2609.08484
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08484
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:59.536Z
- SHA-256 of the archived text
5b3e5bf03f63e32b03914537264cb8903d4d8825e2894a0cb2342009de0b80d7- Stable URL of this page
https://metraipolis.com/documento/dc_db506b8cd637
How to cite
Sequence b-colorings in graphs — arXiv:2609.08484 — arXiv (en), https://arxiv.org/abs/2609.08484 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db506b8cd637 (Metraipolis archive dc_db506b8cd637, sha256 5b3e5bf03f63e32b03914537264cb8903d4d8825e2894a0cb2342009de0b80d7)
BibTeX
@misc{dcdb506b8cd637,
title = {Sequence b-colorings in graphs — arXiv:2609.08484},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08484},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db506b8cd637; sha256 5b3e5bf03f63e32b03914537264cb8903d4d8825e2894a0cb2342009de0b80d7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08484. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce and begin the study of sequence b-colorings, a natural generalization of the classical notion of b-colorings introduced by Irving and Manlove in 1999. In a sequence b-coloring, each color class is required to contain a prescribed minimum number of color-dominating vertices (CDVs). We establish several fundamental properties of the associated parameters, prove that every sequence is realizable, and show that the problem of deciding whether a particular graph realizes a particular sequence is NP-complete. We also characterize the sequences realized by cycles, obtain results on regular graphs with prescribed girth, and investigate colorings requiring one additional CDV, including a characterization of connected graphs with chromatic number $3$ for which no such coloring exists. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.08484 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T14:32:29.854Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).