Contractible cliques in k-connected graphs

DOI10.1007/S00373-006-0670-3zbMATH Open1111.05055OpenAlexW1997109421MaRDI QIDQ855302FDOQ855302

Authors: Xiaolong Huang, Xingxing Yu, Xiaoyan Zhang, Zemin 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

Recommendations

• Contractible subgraphs ink-connected graphs
• Contractible edges in minimally \(k\)-connected graphs
• Contractible edges and triangles in \(k\)-connected graphs
• Note on \(k\)-contractible edges in \(k\)-connected graphs
• Contractible elements ink-connected graphs not containing some specified graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Uncontractable 4-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonseparating cycles inK-Connected graphs
• Contractible edges and triangles in \(k\)-connected graphs
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

Cited In (3)

• Cliques in \(k\)-connected graphs
• Contractible subgraphs ink-connected graphs
• On the structure of \(k\)-connected graphs without \(K_{k}\)-minor

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855302)