Small cycle cover of 2-connected cubic graphs

DOI10.1016/S0012-365X(03)00058-XzbMath1029.05126MaRDI QIDQ1402087

Hong-Jian Lai, Xiangwen Li

Publication date: 19 August 2003

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

Mathematics Subject Classification ID

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

Related Items (4)

Dicycle cover of Hamiltonian oriented graphs ⋮ Small cycle covers of 3-connected cubic graphs ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ How many circuits determine an oriented matroid?

Cites Work

• Subgraph coverings and edge switchings
• Polyhedral decompositions of cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Small cycle cover of 2-connected cubic graphs