×

zbMATH — the first resource for mathematics

On the equality of the Grundy and ochromatic numbers of a graph. (English) Zbl 0708.05021
Summary: It is proved in this note that the Grundy number, \(\Gamma(G)\), and the ochromatic number, \(\chi^0(G)\), are the same for any graph \(G\).

MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Graphs and Hypergraphs. North Holland, Amsterdam (1973).
[2] Theory of Graphs and its Applications, Methuen, London (1962).
[3] and , Graph Theory with Applications. American Elsevier, New York (1976). · Zbl 1226.05083
[4] Christen, J. Comb. Th. Series B 27 pp 49– (1979)
[5] Cockayne, J. Comb. Th. Series B 32 pp 286– (1982)
[6] Grundy, Eureka 2 pp 6– (1939)
[7] Harary, Port. Math. 26 pp 453– (1967)
[8] Harary, J. Comb. Theory 8 pp 154– (1970)
[9] , , and , Complete coloring parameters of graphs, unpublished manuscript. · Zbl 0646.05026
[10] Heawood, Quart. J. Math. 24 pp 312– (1890)
[11] Hedetniemi, Congressus Numerantium 36 pp 351– (1982)
[12] Kempe, Amer. J. Math. 2 pp 193– (1879)
[13] Coloring random graphs badly. In Graph Theory and Combinatorics. Ed. Pitman Advanced Publishing Program, San Francisco (1979).
[14] Simmons, Congressus Numerantium 36 pp 59– (1982)
[15] The ochromatic number of graphs. Proceedings of the First Colorado Symposium on Graph Theory. Ed. Wiley, New York (1983).
[16] Simmons, Congressus Numerantium 40 pp 339– (1983)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.