On Perfect Matching Coverings and Even Subgraph Coverings

DOI10.1002/jgt.21863zbMath1330.05128OpenAlexW1581916263MaRDI QIDQ3466356

Cun-Quan Zhang, Hong-Jian Lai, Xin Min Hou

Publication date: 1 February 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21863

zbMATH Keywords

cycle covermatching cover

Mathematics Subject Classification ID

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

Related Items (10)

Covering a cubic graph by 5 perfect matchings ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ Some snarks are worse than others ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Parity subgraphs with few common edges and nowhere-zero 5-flow ⋮ Treelike snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ S_12 and P_12-colorings of cubic graphs ⋮ A class of cubic graphs satisfying Berge conjecture

Cites Work

• Unnamed Item
• Generation and properties of snarks
• A note on Berge-Fulkerson coloring
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Five cycle double covers of some cubic graphs
• Cycle double covers and spanning minors. I
• On Fulkerson conjecture
• The equivalence of two conjectures of Berge and Fulkerson
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Polyhedral decompositions of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• On cycle-double covers of graphs of small oddness

This page was built for publication: On Perfect Matching Coverings and Even Subgraph Coverings