{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T17:21:46Z","timestamp":1771867306343,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T00:00:00Z","timestamp":1552262400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The PhD Start-up Fund of Natural Science Foundation of Guangdong Province","award":["2018A030310516"],"award-info":[{"award-number":["2018A030310516"]}]},{"name":"The Creative Talents Project Fund of Guangdong Province Department of Education","award":["2017KQNCX053"],"award-info":[{"award-number":["2017KQNCX053"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10878-019-00400-6","type":"journal-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T17:08:19Z","timestamp":1552324099000},"page":"589-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0034-2601","authenticated-orcid":false,"given":"Jun","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingjun","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongrong","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinglin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,11]]},"reference":[{"key":"400_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01206354","volume":"11","author":"REL Aldred","year":"1991","unstructured":"Aldred REL, Holton DA, Jackson B (1991) Uniform cyclic edge connectivity in cubic graphs. Combinatorica 11:81\u201396","journal-title":"Combinatorica"},{"key":"400_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan Press, London"},{"key":"400_CR3","doi-asserted-by":"crossref","unstructured":"Dinitz Y (2006) Dinitz\u2019 algorithm: the original version and Even\u2019s version. In: Theoretical computer science. Springer, Berlin, pp 218\u2013240","DOI":"10.1007\/11685654_10"},{"key":"400_CR4","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k Z, K\u00e1ra J, Kr\u00e1l\u2019 D, Pangr\u00e1c O (2004) An algorithm for cyclic edge connectivity of cubic graphs. In: SWAT 2004, LNCS 3111, 236\u2013247","DOI":"10.1007\/978-3-540-27810-8_21"},{"key":"400_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139015165","volume-title":"Graph algorithms","author":"S Even","year":"2011","unstructured":"Even S (2011) Graph algorithms. Cambridge University Press, Cambridge"},{"key":"400_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S Even","year":"1975","unstructured":"Even S, Tarjan RE (1975) Network flow and testing graph connectivity. SIAM J Comput 4:507\u2013518","journal-title":"SIAM J Comput"},{"key":"400_CR7","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1016\/j.dam.2007.08.046","volume":"156","author":"K Kutnar","year":"2008","unstructured":"Kutnar K, Maru\u0161i\u010d D (2008) On cyclic edge-connectivity of fullerenes. Discrete Appl Math 156:1661\u20131669","journal-title":"Discrete Appl Math"},{"key":"400_CR8","doi-asserted-by":"publisher","unstructured":"Liang J, Lou D (2018) A polynomial algorithm determining cyclic vertex connectivity of \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -regular graphs with fixed \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  . J Comb Optim 1\u201311. \n                    https:\/\/doi.org\/10.1007\/s10878-018-0332-4","DOI":"10.1007\/s10878-018-0332-4"},{"key":"400_CR9","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1080\/00207160.2016.1210792","volume":"94","author":"J Liang","year":"2017","unstructured":"Liang J, Lou D, Zhang Z (2017) A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. Int J Comput Math 94:1501\u20131514","journal-title":"Int J Comput Math"},{"key":"400_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(93)90229-M","volume":"112","author":"D Lou","year":"1993","unstructured":"Lou D, Holton DA (1993) Lower bound of cyclic edge connectivity for \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -extendability of regular graphs. Discrete Math 112:139\u2013150","journal-title":"Discrete Math"},{"key":"400_CR11","first-page":"315","volume":"115","author":"D Lou","year":"2014","unstructured":"Lou D, Liang K (2014) An improved algorithm for cyclic edge connectivity of regular graphs. Ars Comb 115:315\u2013333","journal-title":"Ars Comb"},{"key":"400_CR12","first-page":"311","volume":"77","author":"D Lou","year":"2005","unstructured":"Lou D, Wang W (2005) An efficient algorithm for cyclic edge connectivity of regular graphs. Ars Comb 77:311\u2013318","journal-title":"Ars Comb"},{"key":"400_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/0095-8956(92)90004-H","volume":"56","author":"WD McCuaig","year":"1992","unstructured":"McCuaig WD (1992) Edge reductions in cyclically \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -connected cubic graphs. J Comb Theory Ser B 56:16\u201344","journal-title":"J Comb Theory Ser B"},{"key":"400_CR14","first-page":"481","volume":"45","author":"R Nedela","year":"1995","unstructured":"Nedela R, \u0160koviera M (1995) Atoms of cyclic connectivity in cubic graphs. Math Slovaca 45:481\u2013499","journal-title":"Math Slovaca"},{"key":"400_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(83)90121-8","volume":"46","author":"B Peroche","year":"1983","unstructured":"Peroche B (1983) On several sorts of connectivity. Discrete Math 46:267\u2013277","journal-title":"Discrete Math"},{"key":"400_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"PG Tait","year":"1880","unstructured":"Tait PG (1880) Remarks on the coloring of maps. Proc R Soc Edinb 10:501\u2013503","journal-title":"Proc R Soc Edinb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00400-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00400-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00400-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T00:10:40Z","timestamp":1583799040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00400-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["400"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00400-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,11]]},"assertion":[{"value":"11 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}