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

DOI10.1007/S00373-010-0873-5MaRDI QIDQ604648zbMATH OpenOpenAlexFDO

Authors 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

3-connected graphFannon-essential edgewheel

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• The 3-connected graphs with exactly three non-essential edges
• Minimally 3-connected graphs with exactly k non-essential edges
• On non-essential edges in 3-connected graphs
• On the structure of 3-connected matroids and graphs
• Non-contractible edges in a 3-connected graph

Cites work

• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• Minimally 3-connected graphs with exactly k non-essential edges
• On the structure of 3-connected matroids and graphs
• The 3-connected graphs with exactly three non-essential edges

Cited in

(7)

• On non-essential edges in 3-connected graphs
• The 3-connected graphs with exactly three non-essential edges
• scientific article; zbMATH DE number 4008436 (Why is no real title available?)
• scientific article; zbMATH DE number 1355271 (Why is no real title available?)
• Minimally 3-connected graphs with exactly k non-essential edges
• On 3‐graphs with no four vertices spanning exactly two edges
• Every 4k-edge-connected graph is weakly 3k-linked

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

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