On the equality of the grundy and ochromatic numbers of a graph
From MaRDI portal
Publication:3490012
DOI10.1002/jgt.3190110205zbMath0708.05021OpenAlexW1980678447WikidataQ105824521 ScholiaQ105824521MaRDI QIDQ3490012
William R. Hare, Stephen T. Hedetniemi, Renu C. Laskar
Publication date: 1987
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190110205
Related Items (12)
The digrundy number of digraphs ⋮ Results on the Grundy chromatic number of graphs ⋮ On the Grundy number of Cameron graphs ⋮ On b-acyclic chromatic number of a graph ⋮ Grundy number of corona product of some graphs ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ Greedy \(F\)-colorings of graphs ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ Grundy Coloring and friends, half-graphs, bicliques ⋮ Complexity of Grundy coloring and its variants ⋮ Greedy rankings and arank numbers ⋮ An algorithm for partial Grundy number on trees
Cites Work
This page was built for publication: On the equality of the grundy and ochromatic numbers of a graph
