{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:38:41Z","timestamp":1768451921127,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T00:00:00Z","timestamp":1365033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00373-013-1310-3","type":"journal-article","created":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T05:47:21Z","timestamp":1364968041000},"page":"1003-1011","source":"Crossref","is-referenced-by-count":1,"title":["A Note on Cyclic Connectivity and Matching Properties of Regular Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Michael D.","family":"Plummer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wang","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":[[2013,4,4]]},"reference":[{"key":"1310_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0012-365X(98)00405-1","volume":"206","author":"R.E.L. Aldred","year":"1999","unstructured":"Aldred R.E.L., Holton D.A., Porteous M.I., Plummer M.D.: Two results on matching extensions with prescribed and proscribed edge sets. Discret. Math. 206, 35\u201343 (1999)","journal-title":"Discret. Math."},{"key":"1310_CR2","first-page":"215","volume":"29","author":"R.E.L. Aldred","year":"2004","unstructured":"Aldred R.E.L., Plummer M.D.: Edge proximity and matching extension in planar triangulations. Australas. J. Combin. 29, 215\u2013224 (2004)","journal-title":"Australas. J. Combin."},{"issue":"198","key":"1310_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)90035-3","volume":"197","author":"R.E.L. Aldred","year":"1999","unstructured":"Aldred R.E.L., Plummer M.D.: On matching extensions with prescribed and proscribed edge sets II. Discret. Math. 197(198), 29\u201340 (1999)","journal-title":"Discret. Math."},{"key":"1310_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0012-365X(00)00305-8","volume":"231","author":"R.E.L. Aldred","year":"2001","unstructured":"Aldred R.E.L., Plummer M.D.: On restricted matching extension in planar graphs. Discret. Math. 231, 73\u201379 (2001)","journal-title":"Discret. Math."},{"key":"1310_CR5","doi-asserted-by":"crossref","first-page":"5907","DOI":"10.1016\/j.disc.2007.11.001","volume":"308","author":"R.E.L. Aldred","year":"2008","unstructured":"Aldred R.E.L., Plummer M.D.: Restricted matching in graphs of small genus. Discret. Math. 308, 5907\u20135921","journal-title":"Discret. Math."},{"key":"1310_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.2307\/2370276","volume":"35","author":"G.D. Birkhoff","year":"1913","unstructured":"Birkhoff G.D.: The reducibility of maps. Am. J. Math. 35, 115\u2013128 (1913)","journal-title":"Am. J. Math."},{"key":"1310_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/jctb.2000.2025","volume":"82","author":"I. Fischer","year":"2001","unstructured":"Fischer I., Little C.H.C.: A characterization of Pfaffian near bipartite graphs. J. Combin. Theory Ser. B 82, 175\u2013222 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1310_CR8","unstructured":"Holton, D., Plummer, M.D.: 2 V-extendability in 3V-polytopes, Combinatorics (Eger, 1987). Colloq. Math. Soc. Jnos Bolyai, 52, 281\u2013300, North-Holland, Amsterdam (1988)"},{"key":"1310_CR9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0012-365X(01)00060-7","volume":"244","author":"C.H.C. Little","year":"2002","unstructured":"Little C.H.C., Rendl F., Fischer I.: Towards a characterization of Pfaffian near bipartite graphs. Discret. Math. 244, 279\u2013297 (2002)","journal-title":"Discret. Math."},{"key":"1310_CR10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0012-365X(00)00328-9","volume":"231","author":"G.Z. Liu","year":"2001","unstructured":"Liu G.Z., Yu Q.L.: Generalization of matching extensions in graphs. Discret. Math. 231, 311\u2013320 (2001)","journal-title":"Discret. Math."},{"key":"1310_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0012-365X(93)90229-M","volume":"112","author":"D.J. Lou","year":"1993","unstructured":"Lou D.J., Holton D.A.: Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discret. Math. 112, 139\u2013150 (1993)","journal-title":"Discret. Math."},{"key":"1310_CR12","first-page":"311","volume":"77","author":"D. Lou","year":"2005","unstructured":"Lou D., Wang W.: An efficient algorithm for cyclic edge connectivity of regular graphs. Ars Combin. 77, 311\u2013318 (2005)","journal-title":"Ars Combin."},{"key":"1310_CR13","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory, North-Holland mathematics studies, vol. 121. Ann. Discret. Math., 29. North-Holland Publishing Co., Amsterdam, Akad\u00e9miai Kiad\u00f3, Budapest (1986)"},{"key":"1310_CR14","unstructured":"McGregor-Macdonald, A.: The E(m, n) property. M.S. thesis, University of Otago, Dunedin, New Zealand (2000)"},{"key":"1310_CR15","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1016\/j.dam.2009.01.008","volume":"158","author":"A. Miranda","year":"2010","unstructured":"Miranda A., Lucchesi C.: Recognizing near-bipartite Pfaffian graphs in polynomial time. Discret. Appl. Math. 158, 1275\u20131278 (2010)","journal-title":"Discret. Appl. Math."},{"key":"1310_CR16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0012-365X(81)90006-6","volume":"34","author":"D. Naddef","year":"1981","unstructured":"Naddef D., Pulleyblank W.R.: Matchings in regular graphs. Discret. Math. 34, 283\u2013291 (1981)","journal-title":"Discret. Math."},{"key":"1310_CR17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(83)90121-8","volume":"46","author":"B. P\u00e9roche","year":"1983","unstructured":"P\u00e9roche B.: On several sorts of connectivity. Discret. Math. 46, 267\u2013277 (1983)","journal-title":"Discret. Math."},{"key":"1310_CR18","first-page":"310","volume":"22","author":"J. Plesn\u00ed k","year":"1972","unstructured":"Plesn\u00ed k J.: Connectivity of regular graphs and the existence of 1-factors. Mat. \u010casopis Sloven. Akad. Vied. 22, 310\u2013318 (1972)","journal-title":"Mat. \u010casopis Sloven. Akad. Vied."},{"key":"1310_CR19","first-page":"63","volume":"34","author":"J. Plesn\u00ed k","year":"1979","unstructured":"Plesn\u00ed k J.: Remark on matchings in regular graphs. Acta Fac. Rerum Natur. Univ. Comenian. Math. 34, 63\u201367 (1979)","journal-title":"Acta Fac. Rerum Natur. Univ. Comenian. Math."},{"key":"1310_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0012-365X(92)00485-A","volume":"127","author":"M.D. Plummer","year":"1994","unstructured":"Plummer M.D.: Extending matchings in graphs: a survey. Discret. Math. 127, 277\u2013292 (1994)","journal-title":"Discret. Math."},{"key":"1310_CR21","first-page":"3","volume":"116","author":"M.D. Plummer","year":"1996","unstructured":"Plummer M.D.: Extending matchings in graphs: an update. Congr. Numer. 116, 3\u201332 (1996)","journal-title":"Congr. Numer."},{"key":"1310_CR22","unstructured":"Plummer, M.D.: Matching extension in regular graphs, Graph theory, combinatorics, algorithms, and applications (San Francisco, CA, 1989), pp. 416\u2013436. SIAM, Philadelphia (1991)"},{"key":"1310_CR23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"M.D. Plummer","year":"1980","unstructured":"Plummer M.D.: On n-extendable graphs. Discret. Math. 31, 201\u2013210 (1980)","journal-title":"Discret. Math."},{"key":"1310_CR24","first-page":"163","volume":"13","author":"M.I. Porteous","year":"1996","unstructured":"Porteous M.I., Aldred R.E.L.: Matching extensions with prescribed and forbidden edges. Australas. J. Combin. 13, 163\u2013174 (1996)","journal-title":"Australas. J. Combin."},{"key":"1310_CR25","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s003730170065","volume":"17","author":"H. Wang","year":"2001","unstructured":"Wang H.: On independent cycles in a bipartite graph. Graphs Combin. 17, 177\u2013183 (2001)","journal-title":"Graphs Combin."},{"key":"1310_CR26","unstructured":"West, D.: Introduction to graph theory, 2nd edn. Prentice-Hall Inc., Upper Saddle River (1996)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1310-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1310-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1310-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:35Z","timestamp":1559055575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1310-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,4]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["1310"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1310-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,4]]}}}