The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The hardness of recognising poorly matchable graphs and the hunting of the d-snark |
scientific article; zbMATH DE number 7860529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark |
scientific article; zbMATH DE number 7860529 |
Statements
The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (English)
0 references
5 June 2024
0 references
graph classes
0 references
factorisation
0 references
graph colouring
0 references
connectivity
0 references
snarks
0 references
computational complexity
0 references
0 references
0.7730246186256409
0 references
0.7703098058700562
0 references
0.7632014155387878
0 references
0.7577150464057922
0 references
