Bounds for the Grundy chromatic number of graphs in terms of domination number

DOI10.36045/j.bbms.211019zbMath1528.05024arXiv2212.04154MaRDI QIDQ6073792

Manouchehr Zaker, Abbas Khaleghi

Publication date: 18 September 2023

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringgirthdomination numberGrundy numberfirst-fit coloringstar partitions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-fit colorings of graphs with no cycles of a prescribed even length
• More bounds for the Grundy number of graphs
• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• On the Grundy and \(b\)-chromatic numbers of a graph
• Star partitions on graphs
• A new lower bound on the domination number of a graph
• Inequalities for the Grundy chromatic number of graphs
• Lower bounds for the domination number
• On the First-Fit Chromatic Number of Graphs
• New bounds for the chromatic number of graphs
• Inequalities for the first-fit chromatic number
• On-line and first fit colorings of graphs
• Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $

This page was built for publication: Bounds for the Grundy chromatic number of graphs in terms of domination number