Distribution of contractible edges in k-connected graphs

DOI10.1016/0095-8956(90)90126-KzbMath0687.05028MaRDI QIDQ1262876

Nathaniel Dean

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

k-connected graphk-contractible

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ Contractible cycles in graphs with large minimum degree ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ Contractible edges in longest cycles ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Unnamed Item ⋮ Contractible cycles in graphs with girth at least 5 ⋮ Contractible non-edges in \(3\)-connected graphs ⋮ Distribution of contractible elements in 2-connected matroids ⋮ Contractible and removable edges in 3-connected infinite graphs

Cites Work

• Unnamed Item
• Contractible edges in triangle-free graphs
• Contractible edges in 3-connected graphs
• Generalizaions of critical connectivity of graphs
• Non-separating induced cycles in graphs
• Nonseparating cycles inK-Connected graphs

This page was built for publication: Distribution of contractible edges in k-connected graphs