{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:17:29Z","timestamp":1768724249722,"version":"3.49.0"},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4541,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1994,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider \u201efragmentable\u201d\ufe01 classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomposed into bounded\u2010sized components by removing a small proportion of the vertices. We show that for such graphs of bounded degree the harmonious chromatic number is close to the lower bound (2<jats:italic>m<\/jats:italic>)<jats:sup>1\/2<\/jats:sup>, where <jats:italic>m<\/jats:italic> is the number of edges.<\/jats:p>","DOI":"10.1002\/jgt.3190180305","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T17:09:39Z","timestamp":1181236179000},"page":"257-267","source":"Crossref","is-referenced-by-count":21,"title":["New upper bounds on harmonious colorings"],"prefix":"10.1002","volume":"18","author":[{"given":"Keith","family":"Edwards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"McDiarmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90019-1"},{"key":"e_1_2_1_3_2","unstructured":"I.KrasikovandY.Roditty Bounds for the harmonious chromatic number of a graph. Manuscript (1992)."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190110414"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190150402"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190150606"},{"key":"e_1_2_1_8_2","unstructured":"B.Wilson Line distinguishing and harmonious colorings.Graph Colourings Pitman Research Notes in Mathematics 218 Longman Scientific & Technical Essex (1990)115\u2013133."},{"key":"e_1_2_1_9_2","first-page":"647","article-title":"Decomposition of complete graphs into subgraphs isomorphic to a given graph","volume":"15","author":"Wilson R. M.","year":"1976","journal-title":"Congres. Numer."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190180305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190180305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T02:46:48Z","timestamp":1698115608000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190180305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["10.1002\/jgt.3190180305"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190180305","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}