Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs

DOI10.1016/j.dam.2021.09.015zbMath1483.05064OpenAlexW3201934053MaRDI QIDQ2243130

Zoya Masih, Manouchehr Zaker

Publication date: 11 November 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.015

zbMATH Keywords

graph coloringGrundy number\(b\)-chromatic numberfirst-fit coloringcolor-dominating coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On b-acyclic chromatic number of a graph ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
• Results on the Grundy chromatic number of graphs
• On quasi-monotonous graphs
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• On the Grundy and \(b\)-chromatic numbers of a graph
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• On Grundy and b-chromatic number of some families of graphs: a comparative study
• New bounds for the chromatic number of graphs
• On-line and first fit colorings of graphs

This page was built for publication: Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs