{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:41:04Z","timestamp":1775054464880,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00493-012-2660-9","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:52:17Z","timestamp":1346532737000},"page":"403-424","source":"Crossref","is-referenced-by-count":7,"title":["Perfect matchings in planar cubic graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Maria","family":"Chudnovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,2]]},"reference":[{"key":"2660_CR1","unstructured":"T. Fowler: Unique Coloring of Planar Graphs, Ph.D. thesis, Georgia Institute of Technology, 1998."},{"key":"2660_CR2","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l, J.-S. Sereni and M. Stiebitz: A new lower bound on the number of perfect matchings in cubic graphs, submitted for publication (manuscript 2008).","DOI":"10.1137\/080723843"},{"key":"2660_CR3","volume-title":"Annals of Discrete Math. 29","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. Plummer: Matching Theory, Annals of Discrete Math. 29, North Holland, Amsterdam, 1986."},{"key":"2660_CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1006\/jctb.1997.1798","volume":"72","author":"A. Schrijver","year":"1998","unstructured":"A. Schrijver: Counting 1-factors in regular bipartite graphs, J. Combinatorial Theory, Ser. B 72 (1998), 122\u2013135.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"2660_CR5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H. Whitney","year":"1931","unstructured":"H. Whitney: A theorem on graphs, Ann. Math. 32 (1931), 378\u2013390.","journal-title":"Ann. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2660-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2660-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2660-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T02:02:12Z","timestamp":1643335332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2660-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["2660"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2660-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}