{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:44:19Z","timestamp":1768725859422,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8963,"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":[[1989]]},"DOI":"10.1016\/0012-365x(89)90207-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"151-157","source":"Crossref","is-referenced-by-count":15,"title":["On the harmonious chromatic number of a graph"],"prefix":"10.1016","volume":"74","author":[{"given":"John","family":"Mitchem","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90207-0_BIB1","first-page":"241","article-title":"The line-distinguishing chromatic number of a graph","volume":"14","author":"Frank","year":"1982","journal-title":"Ars Combinatorica"},{"key":"10.1016\/0012-365X(89)90207-0_BIB2","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0604032","article-title":"On the harmonious colorings of graphs","volume":"4","author":"Hopcroft","year":"1983","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"10.1016\/0012-365X(89)90207-0_BIB3","unstructured":"B. Jackson, Some cycle decompositions of complete graphs, preprint, 24 pages,"},{"key":"10.1016\/0012-365X(89)90207-0_BIB4","first-page":"229","article-title":"On the decomposition of the complete graph into 4k-gons","volume":"15","author":"Kotzig","year":"1965","journal-title":"Mat. Fyz. \u010casopis"},{"key":"10.1016\/0012-365X(89)90207-0_BIB5","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1002\/jgt.3190110414","article-title":"An upper bound for the harmonious chromatic number of a graph","volume":"11","author":"Lee","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(89)90207-0_BIB6","unstructured":"Z. Miller and D. Pritikin, The harmonious coloring number of a graph, preprint, 24 pages."},{"key":"10.1016\/0012-365X(89)90207-0_BIB7","first-page":"349","article-title":"On the cyclic decomposition of the complete graph into (4m + 2)-gons","volume":"16","author":"Rosa","year":"1966","journal-title":"Mat. Fyz. \u010casopis"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89902070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89902070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:50:16Z","timestamp":1555134616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89902070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989]]}},"alternative-id":["0012365X89902070"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90207-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}