{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:30:01Z","timestamp":1758054601990,"version":"3.44.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00074-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"89-102","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Euler cycles in the complete graph K2+1"],"prefix":"10.1016","volume":"171","author":[{"given":"Tom\u00e1\u0161","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Havel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Liebl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1979","series-title":"Graph Theory, An Introductory Course, Graduate Texts in Mathematics","author":"Bollobas","key":"10.1016\/S0012-365X(96)00074-X_BIB1"},{"key":"10.1016\/S0012-365X(96)00074-X_BIB2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(82)90212-6","article-title":"Decomposition of a complete graph into trails of given lengths","volume":"42","author":"Bouchet","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00074-X_BIB3","unstructured":"I. Havel and J-M. Laborde, On the harmonious chromatic number of quasistars, Discrete Math., to appear."},{"key":"10.1016\/S0012-365X(96)00074-X_BIB4","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\/S0012-365X(96)00074-X_BIB5","series-title":"Proc. Internat. Colloq.","first-page":"427","article-title":"Decomposition en chaines d'un graphe complet d'ordre impair","volume":"17","author":"Lopez-Bracho","year":"1983"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600074X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600074X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:02:48Z","timestamp":1757916168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600074X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X9600074X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00074-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Euler cycles in the complete graph K2m+1","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(96)00074-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}