On perfect matching coverings and even subgraph coverings
From MaRDI portal
Publication:3466356
DOI10.1002/JGT.21863zbMATH Open1330.05128OpenAlexW1581916263MaRDI QIDQ3466356FDOQ3466356
Authors: Hong-Jian Lai, Cun-Quan Zhang, Xinmin 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
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Five cycle double covers of some cubic graphs
- The equivalence of two conjectures of Berge and Fulkerson
- Generation and properties of snarks
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
- On cycle-double covers of graphs of small oddness
- Title not available (Why is that?)
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Cycle double covers and spanning minors. I
- A note on Berge-Fulkerson coloring
- On Fulkerson conjecture
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
Cited In (12)
- Perfect matching covers of cubic graphs of oddness 2
- A class of cubic graphs satisfying Berge conjecture
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Covering a cubic graph by 5 perfect matchings
- Parity subgraphs with few common edges and nowhere-zero 5-flow
- Ban–Linial's Conjecture and treelike snarks
- Some snarks are worse than others
- Measures of edge-uncolorability of cubic graphs
- Cubic graphs that cannot be covered with four perfect matchings
- \(S_{12}\) and \(P_{12}\)-colorings of cubic graphs
- Five-cycle double cover and shortest cycle cover
- Treelike snarks
This page was built for publication: On perfect matching coverings and even subgraph coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466356)
