Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q6397067)
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
| 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 |
Statements
21 April 2022
0 references
math.CO
0 references
