Removable edges in cyclically 4-edge-connected cubic graphs

DOI10.1007/BF01864149zbMath0643.05046MaRDI QIDQ1101466

Bill Jackson, Lars Døvling Andersen, Herbert Fleischner

Publication date: 1988

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

zbMATH Keywords

cubic graphcyclic edge connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (8)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Decomposition of cubic graphs with cyclic connectivity 5 ⋮ Non removable edges in 3-connected cubic graphs ⋮ Uniform cyclic edge connectivity in cubic graphs ⋮ Snarks with special spanning trees ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Unnamed Item

Cites Work

• Contractible edges in triangle-free graphs
• Contractible edges in 3-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Removable edges in cyclically 4-edge-connected cubic graphs