Cycles through four edges in 3-connected cubic graphs

DOI10.1007/BF02582923MaRDI QIDQ753835zbMATH OpenFDO

Authors 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)

Recommendations

• Cycles through five edges in 3-connected cubic graphs
• Cycles through edges in cyclically \(k\)-connected cubic graphs
• scientific article; zbMATH DE number 1051274
• scientific article; zbMATH DE number 3853111
• Cycles with prescribed and forbidden sets of elements in cubic graphs

Cites work

• scientific article; zbMATH DE number 3503313 (Why is no real title available?)
• A nine point theorem for 3-connected graphs
• Circuits through specified edges
• Cycles through ten vertices in 3-connected cubic graphs
• Girth in graphs

Cited in

(8)

• On circuits through five edges
• Cycles through five edges in 3-connected cubic graphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Paths and cycles concerning independence edges
• Circumference of 3-connected cubic graphs
• Any four independent edges of a 4-connected graph are contained in a circuit
• Cycles through edges in cyclically \(k\)-connected cubic graphs
• The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753835)