NP-Completeness of Perfect Matching Index of Cubic Graphs. - Martin Skoviera; Peter Varsa (STACS, 2022)

Deciding whether four perfect matchings can cover the edges of a snark is NP-complete. - Martin Skoviera; Peter Varsa (Theor. Comput. Sci., 2024)