Metraipolis › archive › dc_feca71148831

On ${\rm b}^{\ast}$-Coloring and $z$-Coloring of graphs with high girth — arXiv:2608.12069

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12069
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:47.415Z
SHA-256 of the archived text
f48251bebb4b991bc38f7a729f3b402d6b529de0e4f7716e3d808a44b1cee807
Stable URL of this page
https://metraipolis.com/documento/dc_feca71148831

How to cite

On ${\rm b}^{\ast}$-Coloring and $z$-Coloring of graphs with high girth — arXiv:2608.12069 — arXiv (en), https://arxiv.org/abs/2608.12069 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_feca71148831 (Metraipolis archive dc_feca71148831, sha256 f48251bebb4b991bc38f7a729f3b402d6b529de0e4f7716e3d808a44b1cee807)
BibTeX
@misc{dcfeca71148831,
  title = {On $rm b^ast$-Coloring and $z$-Coloring of graphs with high girth — arXiv:2608.12069},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12069},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_feca71148831; sha256 f48251bebb4b991bc38f7a729f3b402d6b529de0e4f7716e3d808a44b1cee807},
  year = {2026}
}

Archived text

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

In a proper vertex coloring $c$ of a graph $G$, a vertex $u$ is called a b-vertex if $u$ is adjacent to a vertex in every other color class. A ${\rm b}^{\ast}$-coloring is a proper coloring in which a b-vertex is adjacent to a b-vertex in every other color class. A Grundy coloring is a proper coloring obtained by the First-Fit (greedy) coloring procedure. A $z$-coloring of $G$ is a ${\rm b}^{\ast}$-coloring that is also a Grundy coloring. The ${\rm b}^{\ast}$-chromatic number (resp., $z$-chromatic number), denoted by ${\rm b}^{\ast}(G)$ (resp., $z(G)$), is the maximum number of colors used in a ${\rm b}^{\ast}$-coloring (resp., $z$-coloring) of $G$. Every graph admits a ${\rm b}^{\ast}$-coloring and a $z$-coloring that can be found using a polynomial-time coloring heuristic. Let ${\rm m}^{\ast}(G)$ be the largest integer $k$ such that a vertex of degree at least $k$ in $G$ has $k$ neighbors of degree at least $k$. We employ list-coloring techniques to prove that if $G$ has a girth of at least $7$, then ${\rm b}^{\ast}(G) = {\rm m}^{\ast}(G)+ 1$. A similar result is obtained for graphs of girth at least $6$ when ${\rm m}^{\ast}=3$. Finally, we obtain some results for the $z$-chromatic number. We prove that if the girth is at least $2m^{\ast}(G)+4$ and $G$ contains a specific tree as an ordinary subgraph, then $z(G)= m^{\ast}(G)+1$.

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