A result on quasi \(k\)-connected graphs

DOI10.1007/S11766-015-3057-5zbMath1340.05151MaRDI QIDQ904140

Yingqiu Yang

Publication date: 15 January 2016

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

zbMATH Keywords

component\(k\)-connected graphquasi \(k\)-connected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• Minors of quasi 4-connected graphs
• The structure of quasi 4-connected graphs
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Nonseparating cycles inK-Connected graphs

This page was built for publication: A result on quasi \(k\)-connected graphs