{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:40:13Z","timestamp":1768347613396,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP18H05291"],"award-info":[{"award-number":["JP18H05291"]}],"id":[{"id":"10.13039\/501100001691","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":[[2022,8]]},"DOI":"10.1007\/s00373-022-02526-7","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T13:10:57Z","timestamp":1657631457000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Constructive Characterization of 4-Connected Graphs"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8849-4505","authenticated-orcid":false,"given":"Kiyoshi","family":"Ando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"2526_CR1","series-title":"Lecture Notes on Mathematics","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0060102","volume-title":"The Many Facets of Graph Theory","author":"D Barnette","year":"1969","unstructured":"Barnette, D., Gr\u00fcnbaum, B.: On Steinitz\u2019s theorem concerning convex 3-polytopes and some properties of planar graphs. In: Chartrand, G., Kapoor, S.F. (eds.) The Many Facets of Graph Theory. Lecture Notes on Mathematics, vol. 110, pp. 27\u201339. Springer, Berlin (1969)"},{"key":"2526_CR2","unstructured":"Steinitz, E.: Plyeder und Raumeinteilungen. Enzykl. Math. Wiss., vol. 3 (Geometrie), part 3, AB 12, pp. 1\u2013139 (1922)"},{"key":"2526_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"23","author":"WT Tutte","year":"1961","unstructured":"Tutte, W.T.: A theory of $$3$$-connected graphs. Indag. Math. 23, 441\u2013455 (1961)","journal-title":"Indag. Math."},{"key":"2526_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0095-8956(74)90034-3","volume":"17","author":"PJ Slater","year":"1974","unstructured":"Slater, P.J.: A classification on $$4$$-connected graphs. J. Comb. Theory (B) 17, 281\u2013298 (1974)","journal-title":"J. Comb. Theory (B)"},{"key":"2526_CR5","first-page":"289","volume":"287","author":"M Fontet","year":"1978","unstructured":"Fontet, M.: Graphes $$4$$-essentiels. C. R. Acad. Sci. Paris 287, 289\u2013290 (1978)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2526_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/jgt.3190060310","volume":"6","author":"N Martinov","year":"1982","unstructured":"Martinov, N.: Uncontractible $$4$$-connected graphs. J. Graph Theory 6, 343\u2013344 (1982)","journal-title":"J. Graph Theory"},{"key":"2526_CR7","unstructured":"Kotzig, A.: Doctoral dissertation, Bratislava (1959)"},{"key":"2526_CR8","unstructured":"Simmons, J. G.: Infinite and Finite Sets. Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol. 10, pp. 1277\u20131349. Bolyai-North-Holland (1974)"},{"key":"2526_CR9","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"2007","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises, 2nd edn. AMS Chelsea Publishing, Providence (2007)","edition":"2"},{"key":"2526_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0095-8956(02)00043-6","volume":"88","author":"A Saito","year":"2002","unstructured":"Saito, A.: Splitting and contractible edges in $$4$$-connected graphs. J. Comb. Theory (B) 88, 227\u2013235 (2002)","journal-title":"J. Comb. Theory (B)"},{"key":"2526_CR11","first-page":"341","volume":"B134","author":"G Ding","year":"2019","unstructured":"Ding, G., Qin, C.: A chain theorems for 4-connected graphs. J. Comb. Theory Ser. B 134, 341\u2013349 (2019)","journal-title":"J. Comb. Theory Ser."},{"key":"2526_CR12","unstructured":"Ding, G., Qin, C.: Strengthened chain theorems for different versions of 4-connectivity (2020). arXiv preprint. arXiv:2012.13974"},{"key":"2526_CR13","doi-asserted-by":"publisher","first-page":"1925","DOI":"10.1016\/j.disc.2011.04.032","volume":"311","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. 311, 1925\u20131939 (2011)","journal-title":"Discrete Math."},{"issue":"7","key":"2526_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112416","volume":"344","author":"K Ando","year":"2021","unstructured":"Ando, K.: Contractible edges in $$k$$-connected graphs with minimum degree greater than or equal to $$\\lfloor \\frac{3k-1}{2}\\rfloor$$. Discrete Math. 344(7), 112416 (2021)","journal-title":"Discrete Math."},{"key":"2526_CR15","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0021-9800(69)80049-9","volume":"7","author":"R Harin","year":"1969","unstructured":"Harin, R.: A theorem on $$n$$-connected graphs. J. Comb. Theory 7, 150\u2013154 (1969)","journal-title":"J. Comb. Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02526-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02526-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02526-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T13:16:31Z","timestamp":1660223791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02526-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2526"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02526-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"30 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"118"}}