Covering a cubic graph by 5 perfect matchings

DOI10.1016/j.disc.2017.03.014zbMath1362.05107arXiv1601.03248OpenAlexW2964236189MaRDI QIDQ2397531

Wuyang Sun

Publication date: 22 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03248

zbMATH Keywords

cubic graphhypo-Hamiltonian graphBerge conjectureFulkerson conjectureperfect matching cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Perfect matching covers of cubic graphs of oddness 2 ⋮ A class of cubic graphs satisfying Berge conjecture

Cites Work

• Unnamed Item
• Treelike snarks
• A note on Berge-Fulkerson coloring
• Fulkerson-covers of hypohamiltonian graphs
• Fulkerson's conjecture and Loupekine snarks
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• On Fulkerson conjecture
• The equivalence of two conjectures of Berge and Fulkerson
• On Perfect Matching Coverings and Even Subgraph Coverings
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• 1‐Factor and Cycle Covers of Cubic Graphs
• Blocking and anti-blocking pairs of polyhedra
• The Factorization of Linear Graphs

This page was built for publication: Covering a cubic graph by 5 perfect matchings