On the equality of the partial Grundy and upper ochromatic numbers of graphs

DOI10.1016/S0012-365X(03)00184-5zbMath1028.05031OpenAlexW2065534336WikidataQ105473082 ScholiaQ105473082MaRDI QIDQ1415544

Renu C. Laskar, Geert C. E. Prins, Stephen T. Hedetniemi

Publication date: 4 December 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00184-5

zbMATH Keywords

Grundy numberChromatic numberColoringsAchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Grundy Distinguishes Treewidth from Pathwidth ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ Transitivity on subclasses of chordal graphs ⋮ Unnamed Item ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ Grundy Coloring and friends, half-graphs, bicliques ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ Color chain of a graph ⋮ The potential of greed for independence ⋮ On partial Grundy coloring of bipartite graphs and chordal graphs ⋮ Minimum entropy coloring ⋮ An algorithm for partial Grundy number on trees ⋮ Transitivity on subclasses of bipartite graphs

Cites Work

• Contractions and minimal k-colorability
• Ordered colourings of graphs
• Some perfect coloring properties of graphs
• Minimum broadcast graphs
• On Complementary Graphs
• On the equality of the grundy and ochromatic numbers of a graph
• Tight bounds on the chromatic sum of a connected graph
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Coloring of trees with minimum sum of colors
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• The achromatic number of a graph
• An algorithm for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the equality of the partial Grundy and upper ochromatic numbers of graphs