2026-07-25T03:14:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15866 2024-03-06T10:56:23Z ddc:004 open_access

NP-Completeness of Perfect Matching Index of Cubic Graphs Škoviera, Martin Varša, Peter cubic graph edge colouring snark perfect matching covering NP-completeness The perfect matching index of a cubic graph G, denoted by π(G), is the smallest number of perfect matchings needed to cover all the edges of G; it is correctly defined for every bridgeless cubic graph. The value of π(G) is always at least 3, and if G has no 3-edge-colouring, then π(G) ≥ 4. On the other hand, a long-standing conjecture of Berge suggests that π(G) never exceeds 5. It was proved by Esperet and Mazzuoccolo [J. Graph Theory 77 (2014), 144-157] that it is NP-complete to decide for a 2-connected cubic graph whether π(G) ≤ 4. A disadvantage of the proof (noted by the authors) is that the constructed graphs have 2-cuts. We show that small cuts can be avoided and that the problem remains NP-complete even for nontrivial snarks - cyclically 4-edge-connected cubic graphs of girth at least 5 with no 3-edge-colouring. Our proof significantly differs from the one due to Esperet and Mazzuoccolo in that it combines nowhere-zero flow methods with elements of projective geometry, without referring to perfect matchings explicitly. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Škoviera and Peter Varša 2022 Is Part Of LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2022.56 urn:nbn:de:0030-drops-158667 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.56 eng https://creativecommons.org/licenses/by/4.0/legalcode