Deciding whether four perfect matchings can cover the edges of a snark is NP-complete

Martin Skoviera, Peter Varsa. Deciding whether four perfect matchings can cover the edges of a snark is NP-complete. Theoretical Computer Science, 988:114374, 2024. [doi]

Abstract

Abstract is missing.