On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223)

From MaRDI portal
Revision as of 16:16, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jgt/EsperetM14, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
  • On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings

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
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references