Deciding whether four perfect matchings can cover the edges of a snark is NP-complete (Q6150678)
From MaRDI portal
scientific article; zbMATH DE number 7802229
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding whether four perfect matchings can cover the edges of a snark is NP-complete |
scientific article; zbMATH DE number 7802229 |
Statements
Deciding whether four perfect matchings can cover the edges of a snark is NP-complete (English)
0 references
9 February 2024
0 references
cubic graph
0 references
perfect matching
0 references
edge colouring
0 references
snark
0 references
NP-completeness
0 references
