{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:58:12Z","timestamp":1767193092139},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0012-365x(03)00184-5","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:32:50Z","timestamp":1063737170000},"page":"53-64","source":"Crossref","is-referenced-by-count":25,"title":["On the equality of the partial Grundy and upper ochromatic numbers of graphs"],"prefix":"10.1016","volume":"272","author":[{"given":"Paul","family":"Erd\u00f6s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renu C.","family":"Laskar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geert C.E.","family":"Prins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00184-5_BIB1","series-title":"Theory of Graphs and its Applications","author":"Berge","year":"1962"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB3","doi-asserted-by":"crossref","unstructured":"J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, American Elsevier, New York, 1976, p. 133.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","article-title":"Some perfect coloring properties of graphs","volume":"27","author":"Christen","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","article-title":"An algorithm for the chromatic number of a graph","volume":"14","author":"Christofides","year":"1971","journal-title":"Comput. J."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB6","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0095-8956(82)90005-3","article-title":"Ordered colourings of graphs","volume":"32","author":"Cockayne","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jgt.3190110205","article-title":"On the equality of the Grundy and Ochromatic numbers of a graph","volume":"11","author":"Erd\u00f6s","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB8","first-page":"17","article-title":"Graphs that require many colors to achieve their chromatic sum","volume":"71","author":"Erd\u00f6s","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","article-title":"Minimum broadcast graphs","volume":"25","author":"Farley","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB10","unstructured":"N. Goyal, S. Vishwanathan, NP-completeness of undirected Grundy numbering and related problems, unpublished manuscript, 1997."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB11","first-page":"6","article-title":"Mathematics and games","volume":"2","author":"Grundy","year":"1939","journal-title":"Eureka"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB12","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0021-9800(70)80072-2","article-title":"The achromatic number of a graph","volume":"8","author":"Harary","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB13","first-page":"453","article-title":"An interpolation theorem for graphical homomorphisms","volume":"26","author":"Harary","year":"1967","journal-title":"Portugal. Math."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB14","first-page":"351","article-title":"A linear algorithm for the Grundy (coloring) number of a tree","volume":"36","author":"Hedetniemi","year":"1982","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB15","first-page":"49","article-title":"Greedy colorings and the Grundy chromatic number of the n-cube","volume":"26","author":"Hoffman","year":"1999","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB16","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1002\/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B","article-title":"Coloring of trees with minimum sum of colors","volume":"32","author":"Jiang","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB17","unstructured":"D.S. Johnson, Worst case behavior of graph coloring algorithms, in: Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, 1974, pp. 513\u2013527, also Congr. Numer. 10 (1974) 513\u2013528."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB18","first-page":"219","article-title":"Constraints on the chromatic sequence for trees and graphs","volume":"76","author":"Kubicka","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB19","doi-asserted-by":"crossref","unstructured":"E. Kubicka, A. Schwenk, Introduction to chromatic sums, Proceedings of the 17th Annual ACM Computer Science Conference, ACM, New York, 1989, pp. 39\u201345.","DOI":"10.1145\/75427.75430"},{"issue":"3\u20134","key":"10.1016\/S0012-365X(03)00184-5_BIB20","first-page":"43","article-title":"On finding a Grundy function","volume":"54","author":"Marcu","year":"1992","journal-title":"Polytech. Inst. Bucharest Sci. Bull. Chem. Mater. Sci."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB21","series-title":"Graph Theory and Computing","first-page":"109","article-title":"Graph coloring algorithms","author":"Matula","year":"1972"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB22","series-title":"Graph Theory and Combinatorics","first-page":"76","article-title":"Coloring random graphs badly","author":"McDiarmid","year":"1979"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB24","unstructured":"G. Prins, Unpublished manuscript, dated February 8, 1963."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB25","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TC.1981.1675796","article-title":"Minimum broadcast trees","volume":"C\u201330","author":"Proskurowski","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S0012-365X(03)00184-5_BIB26","first-page":"2","article-title":"The ochromatic number of graphs","volume":"11","author":"Simmons","year":"1982","journal-title":"Graph Theory Newslett."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB27","unstructured":"G.J. Simmons, The ordered chromatic number of planar maps, Proceedings of the 13th Southeastern Conference on Numerical Mathematics and Computing, Boca Raton, FL, 1982, pp. 59\u201367."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB28","first-page":"336","article-title":"On the ochromatic number of a graph","volume":"40","author":"Simmons","year":"1983","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB29","first-page":"205","article-title":"A graph-theoretical exorcism","volume":"49","author":"Simmons","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB30","series-title":"Proceedings of the First Colorado Symposium on Graph Theory","first-page":"295","article-title":"The ochromatic number of planar graphs","author":"Simmons","year":"1985"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB31","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","article-title":"Algorithms for vertex partitioning problems on partial k-trees","volume":"10","author":"Telle","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB32","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.3190130310","article-title":"Tight bounds on the chromatic sum of a connected graph","volume":"13","author":"Thomassen","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00184-5_BIB33","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01787480","article-title":"Contractions and minimal k-colorability","volume":"6","author":"Tuza","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB34","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound for the chromatic number of a graph and its application to time table problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Comput. J."},{"key":"10.1016\/S0012-365X(03)00184-5_BIB35","unstructured":"M. Zakar, New trends in greedy colorings of graphs, undated manuscript."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001845?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001845?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T03:59:32Z","timestamp":1550980772000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0012365X03001845"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00184-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}