The 3-connected graphs with exactly three non-essential edges

DOI10.1007/s00373-004-0552-5zbMath1067.05042OpenAlexW1991670162MaRDI QIDQ1889831

Haidong Wu, James G. Oxley

Publication date: 13 December 2004

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

Full work available at URL: https://doi.org/10.1007/s00373-004-0552-5

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (3)

A longest cycle version of Tutte's wheels theorem ⋮ The 3-connected graphs with exactly \(k\) non-essential edges ⋮ Prime vertex-minors of a prime graph

This page was built for publication: The 3-connected graphs with exactly three non-essential edges