{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:53:31Z","timestamp":1648511611847},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00493-010-2482-6","type":"journal-article","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T17:24:05Z","timestamp":1301073845000},"page":"565-580","source":"Crossref","is-referenced-by-count":2,"title":["Non-separating even cycles in highly connected graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Shinya","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,13]]},"reference":[{"issue":"2","key":"2482_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s003-0018-z","volume":"23","author":"G. Chen","year":"2003","unstructured":"G. Chen, R. Gould and X. Yu: Graph Connectivity after path removal, Combinatorica 23(2) (2003), 185\u2013203.","journal-title":"Combinatorica"},{"key":"2482_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0095-8956(87)90053-0","volume":"42","author":"Y. Egawa","year":"1987","unstructured":"Y. Egawa: Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph, J. Combin. Theory Ser. B 42 (1987), 371\u2013377.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2482_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1006\/jctb.2001.2096","volume":"85","author":"K. Kawarabayashi","year":"2002","unstructured":"K. Kawarabayashi: Contractible edges and triangles in k-connected graphs, J. Combin. Theory Ser. B 85 (2002), 207\u2013221.","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2482_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00026-005-0240-4","volume":"9","author":"K. Kawarabayashi","year":"2005","unstructured":"K. Kawarabayashi, O. Lee and X. Yu: Non-separating paths in 4-connected graphs, Ann. Comb. 9(1) (2005), 47\u201356.","journal-title":"Ann. Comb."},{"key":"2482_CR5","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.jctb.2007.11.003","volume":"98","author":"K. Kawarabayashi","year":"2008","unstructured":"K. Kawarabayashi, O. Lee, B. Reed and P. Wollan: A weaker version of Lov\u00e1sz\u2019 path removable conjecture, J. Combin. Theory Ser. B 98 (2008), 972\u2013979.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2482_CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/1097-0118(200101)36:1<52::AID-JGT5>3.0.CO;2-N","volume":"36","author":"M. Kriesell","year":"2001","unstructured":"M. Kriesell: Induced paths in 5-connected graphs, J. Graph Theory 36 (2001), 52\u201358.","journal-title":"J. Graph Theory"},{"key":"2482_CR7","unstructured":"M. Kriesell: Removable paths conjectures, http:\/\/www.fmf.uni-lj.si\/~mohar\/Problems\/P0504Kriesell1.pdf ."},{"key":"2482_CR8","unstructured":"L. Lov\u00e1sz: Problems in graph theory, in: Recent Advances in Graph Theory (ed. M. Fielder), Acadamia Prague, 1975."},{"key":"2482_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190050403","volume":"5","author":"C. Thomassen","year":"1981","unstructured":"C. Thomassen: Non-separating cycles in k-connected graphs, J. Graph Theory 5 (1981), 351\u2013354.","journal-title":"J. Graph Theory"},{"issue":"2","key":"2482_CR10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s004930100028","volume":"21","author":"C. Thomassen","year":"2001","unstructured":"C. Thomassen: The Erd\u0151s-P\u00f3sa property for odd cycles in graphs of large connectivity, Combinatorica 21(2) (2001), 321\u2013333.","journal-title":"Combinatorica"},{"key":"2482_CR11","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. Tutte","year":"1963","unstructured":"W. Tutte: How to draw a graph, Proc. London Math. Soc. 13 (1963), 743\u2013767.","journal-title":"Proc. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2482-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2482-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2482-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:47Z","timestamp":1559079167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2482-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["2482"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2482-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}