Covering a cubic graph by 5 perfect matchings (Q2397531)
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: Covering a cubic graph by 5 perfect matchings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering a cubic graph by 5 perfect matchings |
scientific article |
Statements
Covering a cubic graph by 5 perfect matchings (English)
0 references
22 May 2017
0 references
Berge conjecture
0 references
Fulkerson conjecture
0 references
perfect matching cover
0 references
cubic graph
0 references
hypo-Hamiltonian graph
0 references
0.9394515752792358
0 references
0.914659857749939
0 references
0.9011316895484924
0 references
0.8882341980934143
0 references
