{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:20:23Z","timestamp":1648858823402},"reference-count":13,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,28]],"date-time":"2013-07-28T00:00:00Z","timestamp":1374969600000},"content-version":"vor","delay-in-days":1488,"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":[[2009,7]]},"DOI":"10.1016\/j.disc.2008.07.026","type":"journal-article","created":{"date-parts":[[2008,8,16]],"date-time":"2008-08-16T05:34:16Z","timestamp":1218864856000},"page":"4883-4888","source":"Crossref","is-referenced-by-count":2,"title":["Hamilton decompositions of graphs with primitive complements"],"prefix":"10.1016","volume":"309","author":[{"given":"Sibel","family":"Ozkan","sequence":"first","affiliation":[]},{"given":"C.A.","family":"Rodger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2008.07.026_b1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s003730200001","article-title":"On the Hamilton\u2013Waterloo problem","volume":"18","author":"Adams","year":"2002","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2008.07.026_b2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"issue":"2","key":"10.1016\/j.disc.2008.07.026_b3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/jcd.20005","article-title":"Hamilton cycle rich two-factoizations of complete graphs","volume":"12","author":"Bryant","year":"2004","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2008.07.026_b4","unstructured":"H. Buchanan II, Graph factors and Hamiltonian decompositions, Ph.D. Dissertation, West Virginia University, 1997"},{"key":"10.1016\/j.disc.2008.07.026_b5","unstructured":"H.L. Fu, S.L. Logan, C.A. Rodger, Maximal sets of Hamilton cycles in K2p\u2212F, Discrete Math. (in press)"},{"issue":"2","key":"10.1016\/j.disc.2008.07.026_b6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(84)90020-0","article-title":"Hamiltonian decompositions of complete graphs","volume":"36","author":"Hilton","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2008.07.026_b7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02579280","article-title":"Canonical edge-colourings of locally finite graphs","volume":"2","author":"Hilton","year":"1982","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.disc.2008.07.026_b8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/jctb.1993.1006","article-title":"Maximal sets of 2-factors and Hamiltonian cycles","volume":"57","author":"Hoffman","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20133","key":"10.1016\/j.disc.2008.07.026_b9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.disc.2003.11.031","article-title":"The Hamilton\u2013Waterloo problem: The case of Hamilton cycles and triangle-factors","volume":"284","author":"Horak","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2008.07.026_b10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0012-365X(03)00281-4","article-title":"Hamilton decompositions of complete graphs with a 3-factor leave","volume":"279","author":"Leach","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2008.07.026_b11","first-page":"207","article-title":"Maximal sets of Hamilton cycles in complete multipartite graphs-II","volume":"39","author":"Logan","year":"2009","journal-title":"Australian J. Combin."},{"key":"10.1016\/j.disc.2008.07.026_b12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die Theorie der regul\u00e4ren graphs","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."},{"issue":"4","key":"10.1016\/j.disc.2008.07.026_b13","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00373-004-0573-0","article-title":"Hamilton decomposable graphs with specified leaves","volume":"20","author":"Rodger","year":"2004","journal-title":"Graphs Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X08004779?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X08004779?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,26]],"date-time":"2018-12-26T06:53:22Z","timestamp":1545807202000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X08004779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":13,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["S0012365X08004779"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2008.07.026","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,7]]}}}