Cycles through four edges in 3-connected cubic graphs

DOI10.1007/BF02582923zbMath0717.05043MaRDI QIDQ753835

R. E. L. Aldred, Carsten Thomassen, Derek Holton

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

path system

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (5)

On circuits through five edges ⋮ Circumference of 3-connected cubic graphs ⋮ Cycles through edges in cyclically \(k\)-connected cubic graphs ⋮ Cycles through five edges in 3-connected cubic graphs ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected

Cites Work

• Girth in graphs
• A nine point theorem for 3-connected graphs
• Circuits through specified edges
• Cycles through ten vertices in 3-connected cubic graphs
• Unnamed Item

This page was built for publication: Cycles through four edges in 3-connected cubic graphs