{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T22:10:16Z","timestamp":1659046216398},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T00:00:00Z","timestamp":1495756800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1803-6","type":"journal-article","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T00:38:20Z","timestamp":1495759100000},"page":"617-633","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proper Hamiltonian Paths in Edge-Coloured Multigraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Raquel","family":"\u00c1gueda","sequence":"first","affiliation":[]},{"given":"Valentin","family":"Borozan","sequence":"additional","affiliation":[]},{"given":"Marina","family":"Groshaus","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Manoussakis","sequence":"additional","affiliation":[]},{"given":"Gervais","family":"Mendy","sequence":"additional","affiliation":[]},{"given":"Leandro","family":"Montero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,26]]},"reference":[{"key":"1803_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/jgt.20440","volume":"64","author":"A Abouelaoualim","year":"2010","unstructured":"Abouelaoualim, A., Das, K.C., Fernandez de la Vega, W., Karpinski, M., Manoussakis, Y., Martinhon, C.A., Saad, R.: Cycles and paths in edge-colored graphs with given degrees. J. Graph Theory 64, 63\u201386 (2010)","journal-title":"J. Graph Theory"},{"key":"1803_CR2","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Gutin, G.: Alternating cycles and paths in edge-coloured multigraphs: a survey. Discret. Math. 165\/166, 39\u201360 (1997) (Graphs and combinatorics (Marseille, 1995))","DOI":"10.1016\/S0012-365X(96)00160-4"},{"key":"1803_CR3","volume-title":"Digraphs","author":"J Bang-Jensen","year":"2001","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. Springer, London (2001)"},{"key":"1803_CR4","unstructured":"B\u00e1nkfalvi, M., B\u00e1nkfalvi, Z.: Alternating Hamiltonian circuit in two-coloured complete graphs. In: Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 11\u201318. Academic Press, New York (1968)"},{"issue":"4","key":"1803_CR5","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1051\/ro\/1996300404171","volume":"30","author":"A Benkouar","year":"1996","unstructured":"Benkouar, A., Manoussakis, Y., Paschos, V.T., Saad, R.: Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: some complexity results. RAIRO Rech. Op\u00e9r. 30(4), 417\u2013438 (1996)","journal-title":"RAIRO Rech. Op\u00e9r."},{"issue":"13","key":"1803_CR6","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1016\/j.disc.2006.09.008","volume":"307","author":"OD Byer","year":"2007","unstructured":"Byer, O.D., Smeltzer, D.L.: Edge bounds in nonhamiltonian $$k$$ k -connected graphs. Discret. Math. 307(13), 1572\u20131579 (2007). doi: 10.1016\/j.disc.2006.09.008","journal-title":"Discret. Math."},{"issue":"4","key":"1803_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/jgt.20188","volume":"53","author":"J Feng","year":"2006","unstructured":"Feng, J., Giesen, H.E., Guo, Y., Gutin, G., Jensen, T., Rafiey, A.: Characterization of edge-colored complete graphs with properly colored Hamilton paths. J. Graph Theory 53(4), 333\u2013346 (2006). doi: 10.1002\/jgt.20188","journal-title":"J. Graph Theory"},{"key":"1803_CR8","unstructured":"Montero, L.: Graphs and colors: edge-colored graphs, edge-colorings and proper connections. Ph.D. thesis, University Paris-Sud 11, Orsay, France (2012)"},{"key":"1803_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology","author":"PA Pevzner","year":"2000","unstructured":"Pevzner, P.A.: Computational Molecular Biology. MIT Press, Cambridge (2000)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1803-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1803-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1803-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T21:55:17Z","timestamp":1659045317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1803-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,26]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1803"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1803-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,26]]}}}