{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913616,"version":"3.41.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331013, 12161141005"],"award-info":[{"award-number":["12331013, 12161141005"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["1244047"],"award-info":[{"award-number":["1244047"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["2022JBCG003"],"award-info":[{"award-number":["2022JBCG003"]}]},{"name":"the Basic Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education","award":["2021K2A9A2A11101586"],"award-info":[{"award-number":["2021K2A9A2A11101586"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-025-02893-x","type":"journal-article","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T20:01:40Z","timestamp":1737748900000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An infinite family of snarks with perfect matching cover index 4"],"prefix":"10.1007","volume":"41","author":[{"given":"Wenjuan","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8714-8750","authenticated-orcid":false,"given":"Rong-Xia","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"He","sequence":"additional","affiliation":[]},{"given":"Jaeun","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,24]]},"reference":[{"key":"2893_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-7643-7400-6_7","volume-title":"Graph Theory in Paris","author":"A Bonisoli","year":"2007","unstructured":"Bonisoli, A., Cariolaro, D.: Excessive factorizations of regular graphs. In: Bondy, A., Fonlupt, J., Fouquet, J.-L., Fournier, J.-C., Ram\u00edrez Alfons\u00edn, J. (eds.) Graph Theory in Paris, pp. 73\u201384. Basel, Birkh\u00e4user (2007)"},{"key":"2893_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"DR Fulkerson","year":"1971","unstructured":"Fulkerson, D.R.: Blocking and anti-blocking pairs of polyhedra. Math. Programming 1, 168\u2013194 (1971)","journal-title":"Math. Programming"},{"key":"2893_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1112\/plms\/s3-38.3.423","volume":"38","author":"PD Seymour","year":"1979","unstructured":"Seymour, P.D.: On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte. Proc. Lond. Math. Soc. 38, 423\u2013460 (1979)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2893_CR4","unstructured":"Celmins, U.A.: On cubic graphs that do not have an edge 3-colouring, Thesis (Ph.D.)-University of Waterloo (Canada) (1985)"},{"key":"2893_CR5","first-page":"1","volume":"3","author":"J H\u00e4gglund","year":"2016","unstructured":"H\u00e4gglund, J.: On Snarks that are far from being 3-edge-colorable. Electron. J. Combin. 3, 1\u201310 (2016)","journal-title":"Electron. J. Combin."},{"key":"2893_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.21863","volume":"81","author":"X Hou","year":"2016","unstructured":"Hou, X., Lai, H.-J., Zhang, C.-Q.: On perfect matching coverings and even subgraph coverings. J. Graph Theory 81, 83\u201391 (2016)","journal-title":"J. Graph Theory"},{"key":"2893_CR7","doi-asserted-by":"crossref","unstructured":"M\u00e1\u010dajov\u00e1, E., \u0160koviera, M.: Cubic graphs that cannot be covered with four perfect matchings, J. Combin. Theory, Ser. B 150, 144\u2013176 (2021)","DOI":"10.1016\/j.jctb.2021.04.004"},{"key":"2893_CR8","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1016\/j.disc.2017.03.014","volume":"340","author":"W Sun","year":"2017","unstructured":"Sun, W.: Covering a cubic graph by 5 perfect matchings. Discrete Math. 340, 1889\u20131896 (2017)","journal-title":"Discrete Math."},{"key":"2893_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.4153\/CJM-1954-010-9","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A contribution on the theory of chromatic polynomial. Canad. J. Math. 6, 80\u201391 (1954)","journal-title":"Canad. J. Math."},{"key":"2893_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0004972700042660","volume":"8","author":"G Szekeres","year":"1973","unstructured":"Szekeres, G.: Polyhedral decompositions of cubic graphs. Bull. Austral. Math. Soc. 8, 367\u2013387 (1973)","journal-title":"Bull. Austral. Math. Soc."},{"key":"2893_CR11","doi-asserted-by":"crossref","unstructured":"Itai, A., & Rodeh, M.: Covering a graph by circuits. in Automata, Languages and Programing. Lecture Notes in Computer Science, Berlin: Springer-Verlag. 62, 289\u2013299 (1978)","DOI":"10.1007\/3-540-08860-1_21"},{"key":"2893_CR12","unstructured":"Seymour, P.D.: Sums of circuits, Graph Theory and Related Topics, J.A. Bondy and U.S.R. Murty (eds), New York: Academic Press. p. 342-355 (1979)"},{"key":"2893_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, C.-Q.: Circuit Double Covers of Graphs, Cambridge University Press, ISBN-13: 9780521282352 (2012)","DOI":"10.1017\/CBO9780511863158"},{"key":"2893_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0606035","volume":"6","author":"N Alon","year":"1985","unstructured":"Alon, N., Tarsi, M.: Covering multigraphs by simple circuits. SIAM J. Alg. Disc. Meth. 6, 345\u2013350 (1985)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"2893_CR15","unstructured":"Fouquet, J.L., Vanherpe, J.M.: On the perfect matching index of bridgeless cubic graphs, arXiv:0904.1296 (2009)"},{"key":"2893_CR16","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1002\/jgt.21778","volume":"77","author":"L Esperet","year":"2013","unstructured":"Esperet, L., Mazzuoccolo, G.: On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings. J. Graph Theory 77, 144\u2013157 (2013)","journal-title":"J. Graph Theory"},{"key":"#cr-split#-2893_CR17.1","unstructured":"\u0160koviera, M., Var\u0161a, P.: NP-completeness of perfect matching index of cubic graphs. In: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), P. Berenbrink and B. Monmege (eds.), Art. 56"},{"key":"#cr-split#-2893_CR17.2","unstructured":"pp.56:1-56:12, Leibniz International Proceedings in Informatics, Dagstuhl Publishing (2022)"},{"issue":"1","key":"2893_CR18","first-page":"51","volume":"22","author":"R Lukot\u2019ka","year":"2015","unstructured":"Lukot\u2019ka, R., M\u00e1\u010dajov\u00e1, E., Maz\u00e1k, J., \u0160koviera, M.: Small snarks with large oddness. Electronic J. Combin. 22(1), 51 (2015)","journal-title":"Electronic J. Combin."},{"issue":"1","key":"2893_CR19","first-page":"31","volume":"II","author":"D Blanu\u0161a","year":"1946","unstructured":"Blanu\u0161a, D.: Problem \u010deteriju boja (The problem of four colors), Hrvatsko Prirodoslovno Dru\u0161tvo Glasnik Mat-Fiz. Astr. Ser. II(1), 31\u201342 (1946)","journal-title":"Astr. Ser."},{"key":"2893_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2307\/3610702","volume":"32","author":"B Descartes","year":"1948","unstructured":"Descartes, B.: Network-colourings. Math. Gazette 32, 67\u201369 (1948)","journal-title":"Math. Gazette"},{"key":"2893_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/00029890.1975.11993805","volume":"82","author":"R Isaacs","year":"1975","unstructured":"Isaacs, R.: Infinite families of non-trivial trivalent graphs which are not Tait colorable. Amer. Math. Monthly 82, 221\u2013239 (1975)","journal-title":"Amer. Math. Monthly"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02893-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02893-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02893-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:48Z","timestamp":1748319768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02893-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,24]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2893"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02893-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,24]]},"assertion":[{"value":"22 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}],"article-number":"31"}}