\(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski (Q5300486)
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: \4,5\ is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski |
scientific article; zbMATH DE number 6181905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski |
scientific article; zbMATH DE number 6181905 |
Statements
${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (English)
0 references
27 June 2013
0 references
cycles
0 references
circuits
0 references
edge-cuts
0 references
coverable
0 references
dominating cycle conjecture
0 references
2-factors
0 references
0.7855324149131775
0 references
0.7638441324234009
0 references
