{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:41:37Z","timestamp":1695980497249},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"vor","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":[[2020,6]]},"DOI":"10.1007\/s00493-019-4042-z","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T11:03:01Z","timestamp":1583319781000},"page":"405-433","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cycle Traversability for Claw-Free Graphs and Polyhedral Maps"],"prefix":"10.1007","volume":"40","author":[{"given":"Ervin","family":"Gy\u0151ri","sequence":"first","affiliation":[]},{"given":"Michael D.","family":"Plummer","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Xiaoya","family":"Zha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"4042_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02579268","volume":"1","author":"J A Bondy","year":"1981","unstructured":"J. A. Bondy and L. Lov\u00e1sz: Cycles through specified vertices of a graph, Combinatorica1 (1981), 117\u2013140.","journal-title":"Combinatorica"},{"key":"4042_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00373-015-1608-4","volume":"32","author":"Z Chen","year":"2016","unstructured":"Z. Chen: A twelve vertex theorem for 3-connected claw-free graphs, Graphs Combin.32 (2016), 553\u2013558.","journal-title":"Graphs Combin."},{"key":"4042_CR3","first-page":"153","volume-title":"Surveys in Combinatorics","author":"M Chudnovsky","year":"2005","unstructured":"M. Chudnovsky and P. D. Seymour: The structure of claw-free graphs, in: Surveys in Combinatorics, London Math. Soc. Lecture Note Ser., 327, Cambridge Univ. Press, Cambridge, 2005, 153\u2013171."},{"key":"4042_CR4","first-page":"65","volume-title":"(Proc. Third Ann Arbor Conf. Graph Theory, Univ. Michigan, Ann Arbor, Mich., 1971)","author":"V Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal: New directions in Hamiltonian graph theory, (Proc. Third Ann Arbor Conf. Graph Theory, Univ. Michigan, Ann Arbor, Mich., 1971), Academic Press, New York, 1973, 65\u201395."},{"key":"4042_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/mana.19600220107","volume":"22","author":"G A Dirac","year":"1960","unstructured":"G. A. Dirac: In abstrakten graphen vorhandene vollst\u00e4ndige 4-graphen und ihre unterteilungen, Math. Nachr.22 (1960), 61\u201385.","journal-title":"Math. Nachr."},{"key":"4042_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02579136","volume":"4","author":"M N Ellingham","year":"1984","unstructured":"M. N. Ellingham, D. A. Holton and C. H.C. Little: Cycles through ten vertices in 3-connected cubic graphs, Combinatorica4 (1984), 265\u2013273.","journal-title":"Combinatorica"},{"key":"4042_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R Faudree","year":"1997","unstructured":"R. Faudree, E. Flandrin and Z. Ryj\u00e1\u010dek: Claw-free graphs\u2013a survey, Discrete Math.164 (1997), 87\u2013147.","journal-title":"Discrete Math."},{"key":"4042_CR8","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1016\/j.disc.2010.04.018","volume":"310","author":"E Flandrin","year":"2010","unstructured":"E. Flandrin, E. Gy\u0151ri, H. Li and J. Shu: Cyclability in k-connected K1,4-free graphs, Discrete Math.310 (2010), 2735\u20132741.","journal-title":"Discrete Math."},{"key":"4042_CR9","doi-asserted-by":"publisher","first-page":"6299","DOI":"10.1016\/j.disc.2008.04.017","volume":"309","author":"R Gould","year":"2009","unstructured":"R. Gould: A look at cycles containing specified elements of a graph, Discrete Math.309 (2009), 6299\u20136311.","journal-title":"Discrete Math."},{"key":"4042_CR10","first-page":"233","volume":"38","author":"E Gy\u0151ri","year":"2001","unstructured":"E. Gy\u0151ri and M. D. Plummer: A nine vertex theorem for 3-connected claw-free graphs, Stud. Sci. Math. Hungar.38 (2001), 233\u2013244.","journal-title":"Stud. Sci. Math. Hungar."},{"key":"4042_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/jgt.10011","volume":"39","author":"R H\u00e4ggkvist","year":"2002","unstructured":"R. H\u00e4ggkvist and W. Mader: Circuits through prescribed vertices in k-connected k-regular graphs, J. Graph Theory39 (2002), 145\u2013163.","journal-title":"J. Graph Theory"},{"key":"4042_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(82)90078-4","volume":"41","author":"R H\u00e4ggkvist","year":"1982","unstructured":"R. H\u00e4ggkvist and C. Thomassen: Circuits through specified edges, Discrete Math.41 (1982), 29\u201334.","journal-title":"Discrete Math."},{"key":"4042_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02992931","volume":"33","author":"R Halin","year":"1969","unstructured":"R. Halin: Zur Theorie der n-fach zusammenh\u00e4ngenden Graphen, Abh. Math. Sem Hamburg33 (1969), 133\u2013164.","journal-title":"Abh. Math. Sem Hamburg"},{"key":"4042_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02579281","volume":"2","author":"D A Holton","year":"1982","unstructured":"D. A. Holton, B. D. McKay, M. D. Plummer and C. Thomassen: A nine point theorem for 3-connected graphs, Combinatorica2 (1982), 53\u201362.","journal-title":"Combinatorica"},{"key":"4042_CR15","first-page":"129","volume":"16","author":"D A Holton","year":"1982","unstructured":"D. A. Holton and M. D. Plummer: Cycles through prescribed and forbidden point sets, (Workshop on Combinatorial Optimization, Bonn, 1980), Ann. Discrete Math.16, North-Holland, 1982, 129\u2013147.","journal-title":"Ann. Discrete Math."},{"key":"4042_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(86)90049-X","volume":"62","author":"D A Holton","year":"1986","unstructured":"D. A. Holton and C. Thomassen: Research problem 81, Discrete Math.62 (1986), 111\u2013112.","journal-title":"Discrete Math."},{"key":"4042_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.2001.2059","volume":"84","author":"K Kawarabayashi","year":"2002","unstructured":"K. Kawarabayashi: One or two disjoint circuits cover independent edges: Lov\u00e1sz\u2014Woodall Conjecture, J. Combin. Theory Ser. B84 (2002), 1\u201344.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4042_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.jctb.2003.08.002","volume":"90","author":"K Kawarabayashi","year":"2004","unstructured":"K. Kawarabayashi: Cycles through a prescribed vertex set in N-connected graphs, J. Combin. Theory Ser. B90 (2004), 315\u2013323.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4042_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0012-365X(82)90299-0","volume":"38","author":"A K Kelmans","year":"1982","unstructured":"A. K. Kelmans and M. V. Lomonosov: When m vertices in a k-connected graph cannot be walked round along a simple cycle, Discrete Math.38 (1982), 317\u2013322.","journal-title":"Discrete Math."},{"key":"4042_CR20","first-page":"82","volume":"4","author":"L Lov\u00e1sz","year":"1974","unstructured":"L. Lov\u00e1sz, Problem 5, Per. Math. Hungar.4 (1974), 82.","journal-title":"Per. Math. Hungar."},{"key":"4042_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"M M Matthews","year":"1984","unstructured":"M. M. Matthews and D. P. Sumner: Hamiltonian results in K1;3-free graphs, J. Graph Theory8 (1984), 139\u2013146.","journal-title":"J. Graph Theory"},{"key":"4042_CR22","first-page":"321","volume":"16","author":"D M Mesner","year":"1966","unstructured":"D. M. Mesner and M. E. Watkins: Some theorems about n-vertex connected graphs, J. Math. Mech.16 (1966), 321\u2013326.","journal-title":"J. Math. Mech."},{"key":"4042_CR23","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"B. Mohar and C. Thomassen: Graphs on Surfaces, Hopkins Univ. Press, Baltimore, 2001."},{"key":"4042_CR24","volume-title":"Hamiltonian Graphs","author":"D A Nelson","year":"1973","unstructured":"D. A. Nelson: Hamiltonian Graphs, M.A. Thesis, Vanderbilt University, 1973."},{"key":"4042_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-247X(68)90163-7","volume":"22","author":"H Perfect","year":"1968","unstructured":"H. Perfect: Applications of Menger's Graph Theorem, J. Math. Anal. Appl.22 (1968), 96\u2013111.","journal-title":"J. Math. Anal. Appl."},{"key":"4042_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.4153\/CMB-1973-047-4","volume":"16","author":"M D Plummer","year":"1973","unstructured":"M. D. Plummer and E. Wilson: On cycles and connectivity in planar graphs, Canad. Math. Bull.16 (1973), 283\u2013288.","journal-title":"Canad. Math. Bull."},{"key":"4042_CR27","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(73)90029-4","volume":"15","author":"G T Sallee","year":"1973","unstructured":"G. T. Sallee: Circuits and paths through specified nodes, J. Combin. Theory Ser. B15 (1973), 32\u201339.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4042_CR28","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1006\/jctb.1994.1058","volume":"62","author":"R Thomas","year":"1994","unstructured":"R. Thomas and X. Yu: 4-connected projective-planar graphs are Hamiltonian, J. Combin. Theory Ser. B62 (1994), 114\u2013132.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4042_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"W T Tutte","year":"1956","unstructured":"W. T. Tutte: A theorem on planar graphs, Trans. Amer. Math. Soc.82 (1956), 99\u2013116.","journal-title":"Trans. Amer. Math. Soc."},{"key":"4042_CR30","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.4153\/CJM-1967-121-2","volume":"19","author":"M E Watkins","year":"1967","unstructured":"M. E. Watkins and D. M. Mesner: Cycles and connectivity in graphs, Canad. J. Math.19 (1967), 1319\u20131328.","journal-title":"Canad. J. Math."},{"key":"4042_CR31","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(77)90072-7","volume":"22","author":"D R Woodall","year":"1977","unstructured":"D. R. Woodall: Circuits containing specified edges, J. Combin. Theory Ser. B22 (1977), 274\u2013278.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-4042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-019-4042-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-4042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T02:36:52Z","timestamp":1695868612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-019-4042-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,4]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4042"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-4042-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,4]]},"assertion":[{"value":"14 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}