{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:24:03Z","timestamp":1773145443118,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9304-z","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T19:45:07Z","timestamp":1267472707000},"page":"549-562","source":"Crossref","is-referenced-by-count":13,"title":["Super cyclically edge connected transitive graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Zhao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Bing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"9304_CR1","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1109\/TCS.1987.1086075","volume":"34","author":"D Bauer","year":"1989","unstructured":"Bauer D, Boesch F, Suffel C, Van Slyke R (1989) On the validity of a reduction of reliable network design to a graph extremal problem. IEEE Trans Circuits Syst 34:1579\u20131581","journal-title":"IEEE Trans Circuits Syst"},{"key":"9304_CR2","volume-title":"Extremal graph theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B (1978) Extremal graph theory. Academic Press, London"},{"key":"9304_CR3","doi-asserted-by":"crossref","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, London"},{"key":"9304_CR4","volume-title":"Algebraic graph theory","author":"N Biggs","year":"1993","unstructured":"Biggs N (1993) Algebraic graph theory. Cambridge University Press, Cambridge"},{"key":"9304_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(91)90227-S","volume":"96","author":"DA Holton","year":"1991","unstructured":"Holton DA, Lou D, Plummer MD (1991) On the 2-extendability of planar graphs. Discrete Math 96:81\u201399","journal-title":"Discrete Math"},{"issue":"2","key":"9304_CR6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/12.262126","volume":"43","author":"S Latifi","year":"1994","unstructured":"Latifi S, Hegde M, Naraghi-Pour M (1994) Conditional connectivity measures for large multiprocessor systems. IEEE Trans Comput 43(2):218\u2013222","journal-title":"IEEE Trans Comput"},{"key":"9304_CR7","doi-asserted-by":"crossref","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-extendability of regular graphs. Discrete Math 112:139\u2013150","journal-title":"Discrete Math"},{"key":"9304_CR8","volume-title":"Combinatorial problems and exercises","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L (1979) Combinatorial problems and exercises. North-Holland and Akad\u00e9miai Kiad\u00f3, Amsterdam"},{"key":"9304_CR9","first-page":"289","volume":"16","author":"L Lov\u00e1sz","year":"1965","unstructured":"Lov\u00e1sz L (1965) On graphs not containing independent circuits. Mat Lapole 16:289\u2013299 (in Hungarian)","journal-title":"Mat Lapole"},{"key":"9304_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"M Mader","year":"1971","unstructured":"Mader M (1971) Minimale n-fach Kantenzusammenh\u00e4ngenden Graphen. Math Ann 191:21\u201328","journal-title":"Math Ann"},{"key":"9304_CR11","first-page":"481","volume":"45","author":"R Nedela","year":"1995","unstructured":"Nedela R, Skoviera M (1995) Atoms of cyclic connectivity in cubic graphs. Math Slovaca 45:481\u2013499","journal-title":"Math Slovaca"},{"key":"9304_CR12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BFb0067376","volume":"303","author":"MD Plummer","year":"1972","unstructured":"Plummer MD (1972) On the cyclic connectivity of planar graphs. Lect Notes Math 303:235\u2013242","journal-title":"Lect Notes Math"},{"key":"9304_CR13","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1090\/S0002-9947-1984-0743738-4","volume":"284","author":"N Robertson","year":"1984","unstructured":"Robertson N (1984) Minimal cyclic-4-connected graphs. Trans Am Math Soc 284:665\u2013684","journal-title":"Trans Am Math Soc"},{"key":"9304_CR14","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"PG Tait","year":"1880","unstructured":"Tait PG (1880) Remarks on the colouring of maps. Proc R Soc Edinb 10:501\u2013503","journal-title":"Proc R Soc Edinb"},{"key":"9304_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4757-2491-2_2","volume-title":"Combinatorial network theory","author":"R Tindell","year":"1996","unstructured":"Tindell R (1996) Connectivity of Cayley graphs. In: Du DZ, Hsu DF (eds) Combinatorial network theory. Kluwer, Dordrecht, pp 41\u201364"},{"key":"9304_CR16","doi-asserted-by":"crossref","unstructured":"Wang B, Zhang Z (2010) On cyclic edge connectivity of transitive graphs. Discrete Math, preprint","DOI":"10.1016\/j.disc.2009.02.019"},{"key":"9304_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","volume":"8","author":"ME Watkins","year":"1970","unstructured":"Watkins ME (1970) Connectivity of transitive graphs. J Comb Theory 8:23\u201329","journal-title":"J Comb Theory"},{"key":"9304_CR18","first-page":"41","volume":"30","author":"JM Xu","year":"2004","unstructured":"Xu JM, Liu Q (2004) 2-restricted edge connectivity of vertex-transitive graphs. Australasian J Comb 30:41\u201349","journal-title":"Australasian J Comb"},{"key":"9304_CR19","volume-title":"Integer flows and cycle covers of graphs","author":"CQ Zhang","year":"1997","unstructured":"Zhang CQ (1997) Integer flows and cycle covers of graphs. Marcel Dekker, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9304-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9304-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9304-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T14:30:46Z","timestamp":1711290646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9304-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9304"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9304-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}