An algorithm for partial Grundy number on trees

DOI10.1016/j.disc.2005.09.008zbMath1077.05046OpenAlexW2013975601MaRDI QIDQ2576842

Stephen T. Hedetniemi, Alice A. McRae, Ken Kennedy, Zhengnan Shi, Renu C. Laskar, Wayne Goddard

Publication date: 29 December 2005

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

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

zbMATH Keywords

graph algorithmslinear algorithmspartial Grundy coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

\(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ Color chain of a graph ⋮ On partial Grundy coloring of bipartite graphs and chordal graphs

Cites Work

• Topics on perfect graphs
• Some perfect coloring properties of graphs
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Grundy coloring for power graphs
• On the equality of the grundy and ochromatic numbers of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for partial Grundy number on trees