The 3-connected graphs with exactly \(k\) non-essential edges

DOI10.1007/S00373-010-0873-5zbMath1231.05159OpenAlexW2056643032MaRDI QIDQ604648

Yuxing Liu

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0873-5

zbMATH Keywords

wheel3-connected graphFannon-essential edge

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• On the structure of 3-connected matroids and graphs
• The 3-connected graphs with exactly three non-essential edges
• Unnamed Item
• Unnamed Item

This page was built for publication: The 3-connected graphs with exactly \(k\) non-essential edges