Metraipolis › archive › dc_e4d703f856fc

On B-Colorings in Planar Graphs — arXiv:2608.09787

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09787
License (as archived)
CC0-1.0
Archived
2026-10-19T09:09:06.826Z
SHA-256 of the archived text
c8218a7b3ade1335e085544388dd5fbdb6a13daa1815e85efd99684ef3633feb
Stable URL of this page
https://metraipolis.com/documento/dc_e4d703f856fc

How to cite

On B-Colorings in Planar Graphs — arXiv:2608.09787 — arXiv (en), https://arxiv.org/abs/2608.09787 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e4d703f856fc (Metraipolis archive dc_e4d703f856fc, sha256 c8218a7b3ade1335e085544388dd5fbdb6a13daa1815e85efd99684ef3633feb)
BibTeX
@misc{dce4d703f856fc,
  title = {On B-Colorings in Planar Graphs — arXiv:2608.09787},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09787},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e4d703f856fc; sha256 c8218a7b3ade1335e085544388dd5fbdb6a13daa1815e85efd99684ef3633feb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09787. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Gyárfás and Sárközy [Studia Sci. Math. Hungar., 2023] defined a B-coloring of a graph to be a proper coloring of the edge set in which any $C_4$ is totally multicolored. Let $q_B(G)$ denote the minimum number of colors sufficient for a B-coloring of a graph $G$. In this paper, we prove that any planar graph $G$ with $\Delta=\Delta(G)$ and $\Delta_2=\Delta_2(G)$ has $q_B(G)\leq\Delta+\max\{\Delta_2,38\}$, refining a bound by Kong, Wang, and Zheng [J. Graph Theory, 2026].

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.09787 — 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-19T09:05:33.594Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).