High connectivity keeping sets in graphs and digraphs

DOI10.1016/j.disc.2004.07.032zbMath1076.05049OpenAlexW1964558620MaRDI QIDQ2575793

W. Mader

Publication date: 6 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.032

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

Critical vertices in \(k\)-connected digraphs ⋮ Contractibility and the Hadwiger conjecture ⋮ A connected subgraph maintaining high connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(k\)-critical \(2 k\)- connected graphs
• On locally \(k\)-critically \(n\)-connected graphs
• High connectivity keeping sets in \(n\)-connected graphs
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• Vertices of small degree in critically \(n\)-connected digraphs
• Endlichkeitssätze für k-kritische Graphen
• On k-critical, n-connected graphs
• Contractible triples in 3-connected graphs
• Fragments in 2-critically \(n\)-connected graphs
• On the existence of \((k,l)\)-critical graphs
• On \(k\)-con-critically \(n\)-connected graphs
• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• Contractible subgraphs in 3-connected graphs
• Almost all 3-connected graphs contain a contractible set of \(k\) vertices
• A recursive characterization of the 4-connected graphs
• Zur Theorie der n-fach zusammenhängenden Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Connectivity of circulant digraphs
• Kuratowski's theorem
• Uncontractable 4-connected graphs
• Large k‐preserving sets in infinite graphs
• Proof of Mader's conjecture on k‐critical n‐connected graphs
• On Vertices of outdegree n in minimally n‐connected digraphs
• On critically connected digraphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: High connectivity keeping sets in graphs and digraphs