{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:38:46Z","timestamp":1648687126156},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,21]],"date-time":"2013-09-21T00:00:00Z","timestamp":1379721600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00373-013-1368-y","type":"journal-article","created":{"date-parts":[[2013,9,20]],"date-time":"2013-09-20T07:40:37Z","timestamp":1379662837000},"page":"243-254","source":"Crossref","is-referenced-by-count":0,"title":["The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Chengfu","family":"Qin","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Kiyoshi","family":"Ando","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,21]]},"reference":[{"key":"1368_CR1","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"64","author":"W.T. Tutte","year":"1961","unstructured":"Tutte W.T.: A theory of 3-connected graphs. Nederl. Akad. Wetensch. Proc. Ser. A 64, 441\u2013455 (1961)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A"},{"key":"1368_CR2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/jgt.3190110407","volume":"11","author":"M.D. Plummer","year":"1987","unstructured":"Plummer M.D., Toft B.: Cyclic coloration of 3-polytopes. J. Graph Theory 11, 507\u2013515 (1987)","journal-title":"J. Graph Theory"},{"key":"1368_CR3","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/j.jctb.2006.02.009","volume":"96","author":"M. Kriesell","year":"2006","unstructured":"Kriesell M.: Contractions, cycle double covers, and cyclic colorings in locally connected graphs. J. Comb. Theory Ser. B 96, 881\u2013900 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1368_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.20131","volume":"51","author":"M. Kriesell","year":"2006","unstructured":"Kriesell M.: Average degree and Contractibility. J. Graph Theory 51, 205\u2013224 (2006)","journal-title":"J. Graph Theory"},{"key":"1368_CR5","unstructured":"Su, J.: Vertices of degree 5 in contraction critical 5-connected graphs. J. Guangxi Norm. Univ. 3, 12\u201316 (1997) (in Chinese)"},{"key":"1368_CR6","unstructured":"Yuan, X.: The contractible edges of 5-connected graphs. J. Guangxi Norm. Univ. 3, 30\u201332 (1994) (in Chinese)"},{"key":"1368_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00373-004-0591-y","volume":"21","author":"K. Ando","year":"2005","unstructured":"Ando K.: Vertices of degree 5 in a contraction critically 5-connected graph. Graphs Comb. 21, 27\u201337 (2005)","journal-title":"Graphs Comb."},{"key":"1368_CR8","doi-asserted-by":"crossref","unstructured":"Ando, K.: (2009) A local structure theorem on 5-connected graphs. J. Graph Theory 60, 99\u2013129","DOI":"10.1002\/jgt.20350"},{"key":"1368_CR9","doi-asserted-by":"crossref","first-page":"1925","DOI":"10.1016\/j.disc.2011.04.032","volume":"331","author":"K. Ando","year":"2011","unstructured":"Ando K., Iwase T.: The number of vertices of degree 5 in a contraction critically 5-connected graph. Discrete Math. 331, 1925\u20131939 (2011)","journal-title":"Discrete Math."},{"key":"1368_CR10","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1016\/j.disc.2010.10.022","volume":"311","author":"K. Ando","year":"2011","unstructured":"Ando K., Qin C.: Some structural properties of minimally contraction critically 5-connected graphs. Discrete Math. 311, 1084\u20131097 (2011)","journal-title":"Discrete Math."},{"key":"1368_CR11","doi-asserted-by":"crossref","first-page":"2870","DOI":"10.1016\/j.disc.2008.07.020","volume":"309","author":"T. Li","year":"2009","unstructured":"Li T., Su J.: A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs. Discrete Math. 309, 2870\u20132876 (2009)","journal-title":"Discrete Math."},{"key":"1368_CR12","doi-asserted-by":"crossref","first-page":"5742","DOI":"10.1016\/j.disc.2007.10.041","volume":"308","author":"C. Qin","year":"2008","unstructured":"Qin C., Yuan X., Su J.: Some properties of contraction critical 5-connected graphs. Discrete Math. 308, 5742\u20135756 (2008)","journal-title":"Discrete Math."},{"key":"1368_CR13","first-page":"139","volume":"33","author":"C. Qin","year":"2005","unstructured":"Qin C., Yuan X., Su J.: Triangles in contraction critical 5-connected graphs. Aust. J. Comb. 33, 139\u2013146 (2005)","journal-title":"Aust. J. Comb."},{"key":"1368_CR14","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.disc.2005.09.040","volume":"307","author":"M. Kriesell","year":"2007","unstructured":"Kriesell M.: How to contract an essentially 6-connected graph to a 5-connected graph. Discrete Math. 307, 494\u2013510 (2007)","journal-title":"Discrete Math."},{"key":"1368_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s003730200000","volume":"18","author":"M. Kriesell","year":"2002","unstructured":"Kriesell M.: A survey on contractible edges in graphs of a given vertex connectivity. Graphs Comb. 18, 1\u201330 (2002)","journal-title":"Graphs Comb."},{"key":"1368_CR16","unstructured":"Fijav\u017e, G.: (2001) Graph minors and connectivity. Ph.D. Thesis, University of Ljubljana"},{"key":"1368_CR17","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: (1976) Graph Theory with Applications, MacMillan, London","DOI":"10.1007\/978-1-349-03521-2"},{"key":"1368_CR18","doi-asserted-by":"crossref","unstructured":"Mader, W.: Generalizations of critical connectivity of graphs. Discrete Math. 72, 267\u2013283 (1988)","DOI":"10.1016\/0012-365X(88)90216-6"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1368-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1368-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1368-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:36Z","timestamp":1559041176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1368-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,21]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1368"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1368-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,21]]}}}