Circuits of length 5 in 2-factors of cubic graphs

DOI10.1016/J.DISC.2011.05.026zbMath1242.05222OpenAlexW2041826321MaRDI QIDQ432713

Martin Škoviera, Ján Mazák, Edita Máčajová, Robert Lukot'ka

Publication date: 4 July 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.026

zbMATH Keywords

2-factorsnarkcircuit5-circuit5-cycle

Mathematics Subject Classification ID

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

Related Items (1)

Avoiding 5-Circuits in 2-Factors of Cubic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The number of cycles in 2-factors of cubic graphs
• Snarks without small cycles
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Decompositions and reductions of snarks
• Circular edge-colorings of cubic graphs with girth six

This page was built for publication: Circuits of length 5 in 2-factors of cubic graphs