{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:16:03Z","timestamp":1694625363294},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00373-005-0621-4","type":"journal-article","created":{"date-parts":[[2006,1,30]],"date-time":"2006-01-30T11:48:23Z","timestamp":1138621703000},"page":"445-457","source":"Crossref","is-referenced-by-count":4,"title":["Contractible Edges in 7-Connected Graphs"],"prefix":"10.1007","volume":"21","author":[{"given":"Su Jian","family":"ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Xudong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"621_CR1","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Graduaate Texts in Mathematics, Vol. 173, Springer, Berlin\/New York, 1997","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"621_CR2","doi-asserted-by":"crossref","unstructured":"Egawa, Y.: Contractible edges in n-connected graphs with minimum degree greater than or equal to \n                  \n                 Graphs Combin. 7 (1), 15\u201321 (1991)","DOI":"10.1007\/BF01789459"},{"key":"621_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/jctb.2000.2024","volume":"82","author":"M. Kriesell","year":"2001","unstructured":"Kriesell, M.: A degree sum condition for the existence of a contractible edge in a \u03ba- connected graph. J. Combin. Theory, Ser. B, 82, 81\u2013101 (2001)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"621_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01222585","volume":"22","author":"W. Mader","year":"1971","unstructured":"Mader, W.: Eine Eigenschaft der Atome endlicher graphs. Arch. Math. 22, 333\u2013336 (1971)","journal-title":"Arch. Math."},{"key":"621_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(88)90216-6","volume":"72","author":"W. Mader","year":"1988","unstructured":"Mader, W.: Generalizations of critical connectivity of graphs. Discrete Math. 72, 267\u2013283 (1988)","journal-title":"Discrete Math."},{"key":"621_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/jgt.3190060310","volume":"6","author":"N. Martinov","year":"1982","unstructured":"Martinov, N.: Uncontractable 4-connected graphs. J. Graph Theory 6, 343\u2013344 (1982)","journal-title":"J. Graph Theory"},{"key":"621_CR7","unstructured":"Jianji, S., Xudong, Y.: A new degree sum condition for the existence of a contractible edge in a \u03ba-connected graph. (submitted)"},{"key":"621_CR8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190050403","volume":"5","author":"C. Thomassen","year":"1981","unstructured":"Thomassen, C.: Nonseparating cycles in k-connected graphs, J. Graph Theory 5, 351\u2013354 (1981)","journal-title":"J. Graph Theory"},{"key":"621_CR9","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: A theory of 3-connected graphs, Nederl. Akad. Wet. Proc., Ser. A 64, 441\u2013455 (1961)","DOI":"10.1016\/S1385-7258(61)50045-5"},{"key":"621_CR10","first-page":"30","volume":"3","author":"Y. Xudong","year":"1994","unstructured":"Xudong, Y.: The contractible edges of 5-connected graphs, J. Guangxi Normal University, 3, 30\u201332 (1994)","journal-title":"J. Guangxi Normal University"},{"key":"621_CR11","unstructured":"Xudong, Y., Jianji, S.: Contractible edges in 6 connected graphs, Advances in Mathematics (China) 33(4), 441\u2013446 (2004)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0621-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-005-0621-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0621-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0621-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:01:40Z","timestamp":1652500900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-005-0621-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["621"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0621-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}