On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Shortest coverings of graphs with cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Short cycle covers of cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest circuit covers of cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Short cycle covers and the cycle double cover conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polyhedral decompositions of cubic graphs / rank | |||
Normal rank | |||
Revision as of 03:04, 9 July 2024
scientific article; zbMATH DE number 6302963
- On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings |
scientific article; zbMATH DE number 6302963 |
|
Statements
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (English)
0 references
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings (English)
0 references
9 October 2014
0 references
11 June 2014
0 references
Berge-Fulkerson conjecture
0 references
perfect matchings
0 references
shortest cycle cover
0 references
cubic graphs
0 references
snarks
0 references
snarks.
0 references
