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

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 prove that if the girth is at least $2k+2$ and $G$ contains a specific tree as an ordinary subgraph, then $z(G)\geq k$.