{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:33:39Z","timestamp":1772742819276,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T00:00:00Z","timestamp":1569628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T00:00:00Z","timestamp":1569628800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 11301217"],"award-info":[{"award-number":["No. 11301217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 11571139"],"award-info":[{"award-number":["No. 11571139"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Fujian Province, China","award":["No. 2018J01419"],"award-info":[{"award-number":["No. 2018J01419"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 11771362"],"award-info":[{"award-number":["No. 11771362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00373-019-02103-5","type":"journal-article","created":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T07:02:36Z","timestamp":1569654156000},"page":"1375-1385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Contractible Edges and Removable Edges in 3-Connected Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Liqiong","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,28]]},"reference":[{"key":"2103_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/jgt.3190170310","volume":"17","author":"REL Aldred","year":"1993","unstructured":"Aldred, R.E.L., Hemminger, R.L., Ota, K.: The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17, 361\u2013371 (1993)","journal-title":"J. Graph Theory"},{"key":"2103_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/jgt.3190180105","volume":"18","author":"REL Aldred","year":"1994","unstructured":"Aldred, R.E.L., Hemminger, R.L., Yu, X.: The 3-connected graphs with a maximum matching containing precisely one contractible edge. J. Graph Theory 18, 37\u201350 (1994)","journal-title":"J. Graph Theory"},{"key":"2103_CR3","first-page":"23","volume":"6","author":"REL Aldred","year":"1992","unstructured":"Aldred, R.E.L., Hemminger, R.L., Yu, X.: Maximum matchings in 3-connected graphs contain contractible edges. Australas. J. Comb. 6, 23\u201334 (1992)","journal-title":"Australas. J. Comb."},{"key":"2103_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0095-8956(87)90065-7","volume":"42","author":"K Ando","year":"1987","unstructured":"Ando, K., Enomoto, H., Saito, A.: Contractible edges in 3-connected graphs. J. Comb. Theory Ser. B 42, 87\u201393 (1987)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2103_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0060102","volume-title":"The Many Facets of Graph Theory","author":"David W. Barnette","year":"1969","unstructured":"Barnette, D.W., Grunbaum, D.B.: On Steinitz\u2019s theorem concerning convex 3-polytopes and on some properties of planar graph. In: Many Facets of Graph Theory. Lecture Notes in Mathematics, vol. 110, pp. 27\u201340 (1969)"},{"key":"2103_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"2103_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(90)90126-K","volume":"48","author":"N Dean","year":"1990","unstructured":"Dean, N.: Distribution of contractible edges in $$k$$-connected graphs. J. Comb. Theory Ser. B 48, 1\u20135 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2103_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/jgt.3190130105","volume":"13","author":"N Dean","year":"1989","unstructured":"Dean, N., Hemminger, R.L., Ota, K.: Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13, 17\u201321 (1989)","journal-title":"J. Graph Theory"},{"key":"2103_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02579387","volume":"3","author":"Y Egawa","year":"1986","unstructured":"Egawa, Y., Enomoto, H., Saito, A.: Contractible edges in triangle-free graphs. Combinatorica 3, 269\u2013274 (1986)","journal-title":"Combinatorica"},{"key":"2103_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/jgt.21635","volume":"72","author":"A Elmasry","year":"2013","unstructured":"Elmasry, A., Mehlhorny, K., Schmidtz, M.: Every DFS tree of a 3-connected graph contains a contractible edge. J. Graph Theory 72, 112\u2013121 (2013)","journal-title":"J. Graph Theory"},{"key":"2103_CR11","first-page":"149","volume":"25A","author":"JL Fouquet","year":"1988","unstructured":"Fouquet, J.L., Thuillier, H.: $$k$$-minimal 3-connected cubic graphs. Ars Comb. 25A, 149\u2013190 (1988)","journal-title":"Ars Comb."},{"key":"2103_CR12","doi-asserted-by":"publisher","first-page":"2652","DOI":"10.1016\/j.disc.2011.11.025","volume":"312","author":"JL Fouquet","year":"2012","unstructured":"Fouquet, J.L., Thuillier, H.: On removable edges in 3-connected cubic graphs. Discrete Math. 312, 2652\u20132659 (2012)","journal-title":"Discrete Math."},{"key":"2103_CR13","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s003730200033","volume":"18","author":"K Fujita","year":"2002","unstructured":"Fujita, K.: Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph. Graphs Comb. 18, 447\u2013478 (2002)","journal-title":"Graphs Comb."},{"key":"2103_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02992931","volume":"33","author":"R Halin","year":"1969","unstructured":"Halin, R.: Zur Theorie der $$n$$-fach zusammenhangenden Graphen. Abh. Marh. Sem. Univ. Hamburg 33, 133\u2013164 (1969)","journal-title":"Abh. Marh. Sem. Univ. Hamburg"},{"key":"2103_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/jgt.3190140410","volume":"14","author":"D Holton","year":"1990","unstructured":"Holton, D., Jackson, B., Saito, A., Wormald, N.C.: Removable edges in 3-connected graphs. J. Graph Theory 14, 465\u2013473 (1990)","journal-title":"J. Graph Theory"},{"key":"2103_CR16","first-page":"82","volume":"4","author":"L Lov\u00e1sz","year":"1974","unstructured":"Lov\u00e1sz, L.: Problem 5. Period. Math. Hung. 4, 82 (1974)","journal-title":"Period. Math. Hung."},{"key":"2103_CR17","doi-asserted-by":"crossref","unstructured":"Kang, H., Wu, J., Li, G.: Removable edges of a spanning tree in 3-connected 3-regular graphs. In: Preparata, F.P., Fang, Q. (eds.) Frontiers in Algorithmics. FAW 2007. Lecture Notes in Computer Science, vol. 4613, pp. 337\u2013345. Springer, Berlin","DOI":"10.1007\/978-3-540-73814-5_33"},{"key":"2103_CR18","doi-asserted-by":"publisher","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 prescribed vertex connectivity. Graphs Comb. 18, 1\u201330 (2002)","journal-title":"Graphs Comb."},{"key":"2103_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01864172","volume":"4","author":"K Ota","year":"1988","unstructured":"Ota, K.: The number of contractible edges in 3-connected graphs. Graphs Comb. 4, 333\u2013354 (1988)","journal-title":"Graphs Comb."},{"key":"2103_CR20","first-page":"408","volume":"3","author":"J Ou","year":"2003","unstructured":"Ou, J.: The number of removable edges in 3-connected planar graphs. J. Syst. Sci. Math. Sci. 3, 408\u2013415 (2003)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"2103_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Peterson","year":"1891","unstructured":"Peterson, J.: Die Theorie der regu\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"2103_CR22","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/jctb.1998.1864","volume":"75","author":"J Su","year":"1999","unstructured":"Su, J.: The number of removable edges in 3-connected graphs. J. Comb. Theory Ser. B 75, 74\u201387 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2103_CR23","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1360\/csb1999-44-9-921","volume":"44","author":"J Su","year":"1999","unstructured":"Su, J.: Removable edges in cycles of 3-connected graphs. Chin. Sci. Bull. 44, 921\u2013926 (1999)","journal-title":"Chin. Sci. Bull."},{"key":"2103_CR24","first-page":"141","volume":"30","author":"F Tan","year":"2004","unstructured":"Tan, F., Wu, H.: On contractible edges in 3-connected graphs. Australas. J. Comb. 30, 141\u2013146 (2004)","journal-title":"Australas. J. Comb."},{"key":"2103_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/jgt.3190050304","volume":"5","author":"C Thomassen","year":"1981","unstructured":"Thomassen, C.: Kuratowski\u2019s theorem. J. Graph Theory 5, 225\u2013241 (1981)","journal-title":"J. Graph Theory"},{"key":"2103_CR26","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"64","author":"WT 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":"2103_CR27","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00373-013-1296-x","volume":"30","author":"J Wu","year":"2014","unstructured":"Wu, J., Broersma, H., Kang, H.: Removable edges and chords of longest cycles in 3-connected graphs. Graphs Comb. 30, 743\u2013753 (2014)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02103-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02103-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02103-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T23:20:26Z","timestamp":1601162426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02103-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,28]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2103"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02103-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,28]]},"assertion":[{"value":"25 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}