Circumference of 3-connected cubic graphs
From MaRDI portal
Publication:1682212
DOI10.1016/j.jctb.2017.08.008zbMath1375.05157arXiv1708.08865OpenAlexW2962691589MaRDI QIDQ1682212
Qinghai Liu, Xingxing Yu, Zhao Zhang
Publication date: 28 November 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.08865
Related Items (6)
On the circumference of 3-connected cubic triangle-free plane graphs ⋮ Dual circumference and collinear sets ⋮ Unnamed Item ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Edge decomposition of connected claw-free cubic graphs ⋮ Unnamed Item
Cites Work
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Cycles through five edges in 3-connected cubic graphs
- Cycles through four edges in 3-connected cubic graphs
- Longest cycles in 3-connected cubic graphs
- Cycles through 23 vertices in 3-connected cubic planar graphs
- Longest Cycles in 3-Connected 3-Regular Graphs
- Cycles containing 12 vertices in 3-connected cubic graphs
- Trees in Polyhedral Graphs
- On Hamiltonian Circuits
This page was built for publication: Circumference of 3-connected cubic graphs
