On z-coloring and b^ -coloring of graphs as improved variants of the b-coloring

DOI10.1016/J.DAM.2025.07.036MaRDI QIDQ6927985zbMATH OpenFDO

Publication date 17 September 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.07.036

$\mathrm{b}$-chromatic number $\mathrm{z}$-chromatic number $\mathrm{z}$-coloring graph coloring Grundy number vertex coloring heuristic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

$\mathcal{O}(VE)$ time algorithms for the Grundy (first-fit) chromatic number of block graphs and graphs with large girth
$B$-chromatic number of cacti
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
$b$-coloring of tight graphs
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
A new vertex coloring heuristic and corresponding chromatic number
A note on approximating the b-chromatic number
A tree representation for $P_ 4$-sparse graphs
An Analysis of a Good Algorithm for the Subtree Problem, Corrected
An integer programming approach to b-coloring
Bounds for the b-chromatic number of some families of graphs
Graph theory
Graphs of girth at least 7 have high $b$-chromatic number
Guide to graph colouring. Algorithms and applications
scientific article; zbMATH DE number 1953103 (Why is no real title available?)
scientific article; zbMATH DE number 956851 (Why is no real title available?)
Introduction to algorithms.
Linear recognition of pseudo-split graphs
More results on the $z$-chromatic number of graphs
New bounds for the chromatic number of graphs
On b-greedy colourings and z-colourings
On approximating the b-chromatic number
On the $b$-coloring of $P_{4}$-tidy graphs
On the $b$-dominating coloring of graphs
On the b-coloring of cographs and $P_{4}$-sparse graphs
On-line and first fit colorings of graphs
On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
Results on the Grundy chromatic number of graphs
The b-chromatic number and related topics -- a survey
The b-chromatic number of a graph
Upper bounds on the b-chromatic number and results for restricted graph classes
Using tabu search techniques for graph coloring

This page was built for publication: On z-coloring and $\mathrm{b}^\ast $-coloring of graphs as improved variants of the b-coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927985)