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

DOI10.1007/S00373-010-0873-5zbMATH Open1231.05159OpenAlexW2056643032MaRDI QIDQ604648FDOQ604648

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

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

zbMATH Keywords

wheelFan3-connected graphnon-essential edge

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• On the structure of 3-connected matroids and graphs
• The 3-connected graphs with exactly three non-essential edges
• Minimally 3-connected graphs with exactly \(k\) non-essential edges

Cited In (6)

• On 3‐graphs with no four vertices spanning exactly two edges
• On non-essential edges in 3-connected graphs
• Title not available (Why is that?)
• Minimally 3-connected graphs with exactly \(k\) non-essential edges
• The 3-connected graphs with exactly three non-essential 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)