Removable edges in cycles of a \(k\)-connected graph

DOI10.1007/s10114-011-9278-5zbMath1222.05137OpenAlexW1973050253MaRDI QIDQ546315

Xiaofeng Guo, Li Qiong Xu

Publication date: 24 June 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-9278-5

zbMATH Keywords

\(k\)-connected graphremovable edgeedge-vertex-atom

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
• Minor and minimum cycle bases of a 3-connected planar graph
• Minimally 3-connected graphs
• Generalizaions of critical connectivity of graphs
• Reducible chains in several types of 2-connected graphs
• A classification of 4-connected graphs
• The number of removable edges in 3-connected graphs
• The number of removable edges in a 4-connected graph
• Removable edges in a cycle of a 4-connected graph
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Removable edges in 3-connected graphs
• A Construction Method For Minimally K-Edge-Connected Graphs
• Uncontractable 4-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Minimally 2-connected graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Removable edges in cycles of a \(k\)-connected graph