Avoiding 5-Circuits in 2-Factors of Cubic Graphs
From MaRDI portal
Publication:5502100
DOI10.1137/130942966zbMath1320.05066arXiv1311.0512OpenAlexW1578319717MaRDI QIDQ5502100
Barbora Candráková, Robert Lukot'ka
Publication date: 17 August 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.0512
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On Dominating Even Subgraphs in Cubic Graphs, Measures of edge-uncolorability of cubic graphs, Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor
Cites Work
- Unnamed Item
- Unnamed Item
- Circuits of length 5 in 2-factors of cubic graphs
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- Double covers of cubic graphs with oddness 4
- Five cycle double covers of some cubic graphs
- Reducible configurations for the cycle double cover conjecture
- The traveling salesman problem on cubic and subcubic graphs
- On 2-factors with long cycles in cubic graphs
- Snarks with large oddness and small number of vertices
- Maximum matching and a polyhedron with 0,1-vertices
- Circular edge-colorings of cubic graphs with girth six