Reducible chains in several types of 2-connected graphs

DOI10.1016/0012-365X(92)90151-5zbMath0778.05046OpenAlexW2012190871MaRDI QIDQ1199497

Xiaofeng Guo, Fu Ji Zhang

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90151-5

zbMATH Keywords

upper boundlower bound2-connected graphsreducible chains

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

Perfect matchings and ears in elementary bipartite graphs ⋮ Reducible chains of planar 1-cycle resonant graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph

Cites Work

• Minimally 2-connected graphs.
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducible chains in several types of 2-connected graphs