On Grundy and b-chromatic number of some families of graphs: a comparative study

DOI10.1007/s00373-020-02268-4zbMath1459.05087arXiv2012.10070OpenAlexW3119755051MaRDI QIDQ2657109

Manouchehr Zaker, Zoya Masih

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringGrundy numberb-chromatic numberfirst-fit coloringcolor-dominating coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On b-acyclic chromatic number of a graph ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ Some comparative results concerning the Grundy and \(b\)-chromatic number of 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
• The \(b\)-chromatic number and related topics -- a survey
• On approximating the b-chromatic number
• Some bounds for the \(b\)-chromatic number of a graph
• 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
• b-chromatic number of cacti
• On-line and first fit colorings of graphs

This page was built for publication: On Grundy and b-chromatic number of some families of graphs: a comparative study