Small cycle covers of 3-connected cubic graphs

DOI10.1016/j.disc.2010.10.013zbMath1225.05205OpenAlexW1968602807MaRDI QIDQ615999

Xiangwen Li, Fan Yang

Publication date: 7 January 2011

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

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

zbMATH Keywords

cubic graphscycle covercyclically-\(k\)-edge-connected graphs

Mathematics Subject Classification ID

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

Related Items (2)

Dicycle cover of Hamiltonian oriented graphs ⋮ How many circuits determine an oriented matroid?

Cites Work

• Small cycle cover of 2-connected cubic graphs
• Subgraph coverings and edge switchings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Small cycle covers of 3-connected cubic graphs