Cycles through edges in cyclically \(k\)-connected cubic graphs

DOI10.1016/0012-365X(92)90043-FzbMath0762.05059OpenAlexW2064840267MaRDI QIDQ1196754

William D. McCuaig

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90043-f

zbMATH Keywords

cycledistancecubic graphindependent edges

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ A look at cycles containing specified elements of a graph

Cites Work

• Unnamed Item
• Cycles through five edges in 3-connected cubic graphs
• Cycles through four edges in 3-connected cubic graphs
• Girth in graphs

This page was built for publication: Cycles through edges in cyclically \(k\)-connected cubic graphs