Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777)
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: Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching |
scientific article; zbMATH DE number 7667213
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching |
scientific article; zbMATH DE number 7667213 |
Statements
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (English)
0 references
23 March 2023
0 references
factor
0 references
perfect matching
0 references
circuit
0 references
cubic graph
0 references
snark
0 references
\(S_4\)-conjecture
0 references
Fan-Raspaud conjecture
0 references
Berge-Fulkerson conjecture
0 references
