{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T23:55:11Z","timestamp":1772063711780,"version":"3.50.1"},"reference-count":4,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T00:00:00Z","timestamp":1159920000000},"content-version":"vor","delay-in-days":6882,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1987,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An upper bound for the harmonious chromatic number of a graph <jats:italic>G<\/jats:italic> is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin.<\/jats:p>","DOI":"10.1002\/jgt.3190110414","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T05:09:35Z","timestamp":1181365775000},"page":"565-567","source":"Crossref","is-referenced-by-count":20,"title":["An upper bound for the harmonious chromatic number of a graph"],"prefix":"10.1002","volume":"11","author":[{"given":"Sin\u2010Min","family":"Lee","sequence":"first","affiliation":[]},{"given":"John","family":"Mitchem","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,4]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"241","article-title":"The line\u2010distinguishing chromatic number of a graph","volume":"14","author":"Frank O.","year":"1982","journal-title":"Ars Combin."},{"key":"e_1_2_1_3_2","first-page":"201","article-title":"Graphs with the line\u2010distinguishing chromatic number equal to the usual one","volume":"23","author":"Harary F.","year":"1983","journal-title":"Utilitas Math."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0604032"},{"key":"e_1_2_1_5_2","unstructured":"Z.MillerandD.Pritikin The harmonious coloring number of a graph. Preprint (1985)."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190110414","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190110414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T09:34:51Z","timestamp":1697880891000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190110414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["10.1002\/jgt.3190110414"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190110414","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}