Grundy number and products of graphs

DOI10.1016/J.DISC.2009.09.020zbMath1221.05126OpenAlexW2060292922MaRDI QIDQ968418

Frédéric Havet, Marie Asté, Cláudia Linhares Sales

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.020

zbMATH Keywords

greedy algorithmcolouringon-line algorithmGrundy numberproduct of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

On the Nash number and the diminishing Grundy number of a graph ⋮ Thinness of product graphs ⋮ New Bounds on the Grundy Number of Products of Graphs ⋮ Maximization coloring problems on graphs with few \(P_4\) ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ Minimum order of graphs with given coloring parameters ⋮ More bounds for the Grundy number of graphs ⋮ A note on the Grundy number and graph products ⋮ Multiple Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the Grundy chromatic number of graphs
• n-tuple colorings and associated graphs
• The chromatic number and other functions of the lexicographic product
• On the First-Fit Chromatic Number of Graphs
• On-line and first fit colorings of graphs

This page was built for publication: Grundy number and products of graphs