On the equality of the grundy and ochromatic numbers of a graph
From MaRDI portal
Publication:3490012
DOI10.1002/jgt.3190110205zbMath0708.05021WikidataQ105824521 ScholiaQ105824521MaRDI QIDQ3490012
Stephen T. Hedetniemi, Paul Erdős, Renu C. Laskar, William R. Hare
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
05C15: Coloring of graphs and hypergraphs
Related Items
First-fit chromatic numbers of \(d\)-degenerate graphs, Results on the Grundy chromatic number of graphs, Greedy rankings and arank numbers, Greedy \(F\)-colorings of graphs, On the equality of the partial Grundy and upper ochromatic numbers of graphs, An algorithm for partial Grundy number on trees
Cites Work