{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T08:17:07Z","timestamp":1774513027622,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T00:00:00Z","timestamp":1435104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00493-015-3067-1","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T05:41:17Z","timestamp":1435124477000},"page":"471-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Properly coloured Hamiltonian cycles in edge-coloured complete graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Allan","family":"Lo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"3067_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P","volume":"11","author":"N Alon","year":"1997","unstructured":"N. Alon and G. Gutin: Properly colored Hamilton cycles in edge-colored completegraphs, Random Structures Algorithms 11 (1997), 179\u2013186.","journal-title":"Random Structures Algorithms"},{"key":"3067_CR2","volume-title":"DiscreteMath. Optim.","author":"N Alon","year":"2000","unstructured":"N. Alon and J.H. Spencer: The Probabilistic Method, Wiley-Intersci. Ser. DiscreteMath. Optim., John Wiley & Sons, Hoboken, NJ, 2000."},{"key":"3067_CR3","volume-title":"Springer Monographs in Mathematics","author":"J Bang-Jensen","year":"2009","unstructured":"J. Bang-Jensen and G. Gutin: Digraphs, second ed., Springer Monographs in Mathematics, Springer-Verlag London Ltd., London, 2009, Theory, algorithms andapplications."},{"key":"3067_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0166-218X(97)00062-0","volume":"82","author":"J Bang-Jensen","year":"1998","unstructured":"J. Bang-Jensen, G. Gutin and A. Yeo: Properly coloured Hamiltonian paths inedge-coloured complete graphs, Discrete Appl. Math. 82 (1998), 247\u2013250.","journal-title":"Discrete Appl. Math."},{"key":"3067_CR5","first-page":"316","volume":"50","author":"O Barr","year":"1998","unstructured":"O. Barr: Properly coloured Hamiltonian paths in edge-coloured complete graphswithout monochromatic triangles, Ars Combin. 50 (1998), 316\u2013318.","journal-title":"Ars Combin."},{"key":"3067_CR6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BF02756791","volume":"23","author":"B Bollob\u00c1s","year":"1976","unstructured":"B. Bollob\u00c1s and P. Erd\u0150s: Alternating Hamiltonian cycles, Israel J. Math. 23(1976), 126\u2013131.","journal-title":"Israel J. Math."},{"key":"3067_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0095-8956(76)90053-8","volume":"21","author":"C C Chen","year":"1976","unstructured":"C. C. Chen and D. E. Daykin: Graphs with Hamiltonian cycles having adjacentlines different colors, J. Combin. Theory Ser. B 21 (1976), 135\u2013139.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3067_CR8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0095-8956(76)90007-1","volume":"20","author":"D E Daykin","year":"1976","unstructured":"D. E. Daykin: Graphs with cycles having adjacent lines of different colors, J. Combin.Theory Ser. B 20 (1976), 149\u2013152.","journal-title":"J. Combin.Theory Ser. B"},{"key":"3067_CR9","first-page":"333","volume":"53","author":"J Feng","year":"2006","unstructured":"J. Feng, H. Giesen, Y. Guo, G. Gutin, T. Jensen and A. Rafiey: Characteriza-tion of edge-colored complete graphs with properly colored Hamilton paths, J. GraphTheory 53 (2006), 333\u2013346.","journal-title":"J. GraphTheory"},{"key":"3067_CR10","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1016\/j.dam.2011.06.005","volume":"159","author":"S Fujita","year":"2011","unstructured":"S. Fujita and C. Magnant: Properly colored paths and cycles, Discrete Appl. Math. 159 (2011), 1391\u20131397.","journal-title":"Discrete Appl. Math."},{"key":"3067_CR11","doi-asserted-by":"crossref","first-page":"4349","DOI":"10.1016\/j.disc.2009.01.016","volume":"309","author":"H Li","year":"2009","unstructured":"H. Li and G. Wang: Color degree and alternating cycles in edge-colored graphs, Discrete Math. 309 (2009), 4349\u20134354.","journal-title":"Discrete Math."},{"key":"3067_CR12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-540-73814-5_29","volume":"4613","author":"H Li","year":"2007","unstructured":"H. Li, G. Wang and S. Zhou: Long alternating cycles in edge-colored completegraphs, Lecture Notes in Computer Science 4613 (2007), 305\u2013309.","journal-title":"Lecture Notes in Computer Science"},{"key":"3067_CR13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/jgt.21751","volume":"76","author":"A Lo","year":"2014","unstructured":"A. Lo: A Dirac type condition for properly coloured paths and cycles, Journal ofGraph Theory 76 (2014), 60\u201387.","journal-title":"Journal ofGraph Theory"},{"key":"3067_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/120903750","volume":"28","author":"A Lo","year":"2014","unstructured":"A. Lo: An edge-coloured version of Dirac's theorem, SIAM J. Discrete Math. 28(2014), 18\u201336.","journal-title":"SIAM J. Discrete Math."},{"key":"3067_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","volume":"28","author":"V R\u00f6dl","year":"2008","unstructured":"V. R\u00f6dl, A. Ruci\u0144ski and E. Szemer\u00c9di: An approximate Dirac-type theorem for k-uniform hypergraphs, Combinatorica 28 (2008), 229\u2013260.","journal-title":"Combinatorica"},{"key":"3067_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(79)90020-7","volume":"25","author":"J Shearer","year":"1979","unstructured":"J. Shearer: A property of the colored complete graph, Discrete Math. 25 (1979),175\u2013178.","journal-title":"Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3067-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3067-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3067-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:51Z","timestamp":1559079171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3067-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["3067"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3067-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,24]]}}}