{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:38:22Z","timestamp":1769971102211,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(02)00043-6","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T19:08:58Z","timestamp":1041275338000},"page":"227-235","source":"Crossref","is-referenced-by-count":4,"title":["Splitting and contractible edges in 4-connected graphs"],"prefix":"10.1016","volume":"88","author":[{"given":"Akira","family":"Saito","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00043-6_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0095-8956(87)90065-7","article-title":"Contractible edges in 3-connected graphs","volume":"42","author":"Ando","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB2","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1996"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01350321","article-title":"Untersuchungen \u00fcber minimale n-fach zusammenh\u00e4ngende Graphen","volume":"182","author":"Halin","year":"1969","journal-title":"Math. Ann."},{"key":"10.1016\/S0095-8956(02)00043-6_BIB4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190120314","article-title":"Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs","volume":"12","author":"Jackson","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s003730200000","article-title":"A survey on contractible edges in graphs of a prescribed vertex connectivity","volume":"18","author":"Kriesell","year":"2002","journal-title":"Graphs Combinatorics"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge-connectivity in graphs","volume":"3","author":"Mader","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0095-8956(02)00043-6_BIB7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(88)90216-6","article-title":"Generalizations of critical connectivity of graphs","volume":"72","author":"Mader","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00043-6_BIB8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/jgt.3190060310","article-title":"Uncontractable 4-connected graphs","volume":"6","author":"Martinov","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(90)90277-O","article-title":"A recursive characterization of the 4-connected graphs","volume":"84","author":"Martinov","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(02)00043-6_BIB10","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/jgt.3190110407","article-title":"Cyclic coloration of 3-polytopes","volume":"11","author":"Plummer","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190050304","article-title":"Kuratowski's theorem","volume":"5","author":"Thomassen","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB12","first-page":"441","article-title":"A theory of 3-connected graphs","volume":"64","author":"Tutte","year":"1961","journal-title":"Nederl. Akad. Wet. Proc. Ser. A"},{"key":"10.1016\/S0095-8956(02)00043-6_BIB13","first-page":"206","article-title":"Vertex splitting, parity subgraphs and circuit covers","volume":"20","author":"Zhang","year":"1996","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000436?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:22:59Z","timestamp":1553955779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895602000436"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00043-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}