Contractible cliques in \(k\)-connected graphs

DOI10.1007/S00373-006-0670-3zbMath1111.05055OpenAlexW1997109421MaRDI QIDQ855302

Xiaolong Huang, Xingxing Yu, Xiaoyan Zhang, Ze-min Jin

Publication date: 5 January 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0670-3

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Contractible edges and triangles in \(k\)-connected graphs
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs

This page was built for publication: Contractible cliques in \(k\)-connected graphs