More results on the \(z\)-chromatic number of graphs

DOI10.1016/j.dam.2023.05.025zbMath1519.05079arXiv2302.01306OpenAlexW4380362508MaRDI QIDQ6110594

Abbas Khaleghi, Manouchehr Zaker

Publication date: 2 August 2023

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

Full work available at URL: https://arxiv.org/abs/2302.01306

zbMATH Keywords

graph colouringGrundy number\(b\)-chromatic number\(z\)-chromatic numberfirst-fit colouring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
• Recolouring-resistant colourings
• Results on the Grundy chromatic number of graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph
• Characterization of \(b\gamma\)-perfect graphs
• On the Grundy and \(b\)-chromatic numbers of a graph
• A new vertex coloring heuristic and corresponding chromatic number
• Inequalities for the first-fit chromatic number
• On-line and first fit colorings of graphs
• The NP-Completeness of Edge-Coloring
• Unnamed Item
• Unnamed Item

This page was built for publication: More results on the \(z\)-chromatic number of graphs