1‐Factor and Cycle Covers of Cubic Graphs
From MaRDI portal
Publication:4982281
DOI10.1002/jgt.21798zbMath1309.05108arXiv1209.4510OpenAlexW1500622221MaRDI QIDQ4982281
Publication date: 24 March 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.4510
cubic graphsBerge-Fulkerson conjecture1-factorscycle covers5-cycle double cover conjectureconjecture of Fan and Raspaud
Related Items (19)
Snarks with resistance \(n\) and flow resistance \(2n\) ⋮ Covering a cubic graph by 5 perfect matchings ⋮ Girth, oddness, and colouring defect of snarks ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ Cores, joins and the Fano-flow conjectures ⋮ Petersen Cores and the Oddness of Cubic Graphs ⋮ Cubic graphs with colouring defect 3 ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ Some snarks are worse than others ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Treelike snarks ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Partially normal 5-edge-colorings of cubic graphs ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ The smallest nontrivial snarks of oddness 4 ⋮ A class of cubic graphs satisfying Berge conjecture
Cites Work
- Generation and properties of snarks
- Shortest coverings of graphs with cycles
- Fulkerson's conjecture and circuit covers
- Classification and characterizations of snarks
- Snarks without small cycles
- Short cycle covers of graphs and nowhere-zero flows
- The equivalence of two conjectures of Berge and Fulkerson
- Covering Multigraphs by Simple Circuits
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: 1‐Factor and Cycle Covers of Cubic Graphs
