Cyclically five-connected cubic graphs

DOI10.1016/j.jctb.2017.03.003zbMath1362.05074arXiv1503.02298OpenAlexW3099799705MaRDI QIDQ2396896

Neil Robertson, Robin Thomas, P. D. Seymour

Publication date: 26 May 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

generation theoremcyclically 5-connected cubic graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (9)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Decomposition of cubic graphs with cyclic connectivity 5 ⋮ Splitter theorems for 4-regular graphs ⋮ Superposition of snarks revisited ⋮ Measures of edge-uncolorability of cubic graphs ⋮ The extremal function for Petersen minors ⋮ Excluded minors in cubic graphs ⋮ Generating internally four-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Three-edge-colouring doublecross cubic graphs
• Edge reductions in cyclically \(k\)-connected cubic graphs
• Uniform cyclic edge connectivity in cubic graphs
• The four-colour theorem
• Tutte's edge-colouring conjecture
• Graph minors. IX: Disjoint crossed paths
• On generating planar graphs
• Excluded minors in cubic graphs
• Convex Representations of Graphs
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

This page was built for publication: Cyclically five-connected cubic graphs