Decomposition of cubic graphs with cyclic connectivity 5

DOI10.1016/j.disc.2022.113036zbMath1495.05261arXiv2107.09756OpenAlexW3183824597MaRDI QIDQ2166289

Jozef Rajník, Edita Máčajová

Publication date: 24 August 2022

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

Full work available at URL: https://arxiv.org/abs/2107.09756

zbMATH Keywords

decompositiongirthcubic graphscyclic connectivity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On cyclic edge-connectivity of fullerenes
• Removable edges in cyclically 4-edge-connected cubic graphs
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• The smallest nontrivial snarks of oddness 4
• Cyclically five-connected cubic graphs
• Hamilton cycles in (2, odd, 3)-Cayley graphs
• Minimal Cyclic-4-Connected Graphs
• Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• Problem Session

This page was built for publication: Decomposition of cubic graphs with cyclic connectivity 5