{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:38:28Z","timestamp":1772372308511,"version":"3.50.1"},"reference-count":8,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5422,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1991,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A harmonious coloring of a simple graph <jats:italic>G<\/jats:italic> is a coloring of the vertices such that adjacent vertices receive distinct colors and each pair of colors appears together on at most one edge. The harmonious chromatic number <jats:italic>h<\/jats:italic>(<jats:italic>G<\/jats:italic>) is the least number of colors in such a coloring. We improve an upper bound on <jats:italic>h<\/jats:italic>(<jats:italic>G<\/jats:italic>) due to Lee and Mitchem, and give upper bounds for related quantities.<\/jats:p>","DOI":"10.1002\/jgt.3190150606","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T06:53:00Z","timestamp":1181285580000},"page":"629-636","source":"Crossref","is-referenced-by-count":7,"title":["Upper bounds for harmonious colorings"],"prefix":"10.1002","volume":"15","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luo","family":"Xinhua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"N.Alon C.McDiarmid andB.Reed Acyclic coloring of graphs.Random Structures and Algorithms 2(1991)277\u2013288.","DOI":"10.1002\/rsa.3240020303"},{"key":"e_1_2_1_3_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_4_2","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"1985"},{"key":"e_1_2_1_5_2","volume-title":"Infinite and Finite Sets","author":"Erd\u00f6s P.","year":"1975"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190110414"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90207-0"},{"key":"e_1_2_1_8_2","volume-title":"Ten Lectures on the Probabilistic Method","author":"Spencer J.","year":"1987"},{"key":"e_1_2_1_9_2","unstructured":"B.Wilson Line distinguishing and harmonious colourings.Graph Colourings Pitman Research Notes in Mathematics 218. Longman Scientific & Technical Essex (1990)."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190150606","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190150606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T03:25:20Z","timestamp":1698031520000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190150606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["10.1002\/jgt.3190150606"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190150606","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}