The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)

DOI10.1006/jctb.1999.1929zbMath1023.05089OpenAlexW2090651681MaRDI QIDQ1569066

Matthias Kriesell

Publication date: 25 June 2000

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

Full work available at URL: https://doi.org/10.1006/jctb.1999.1929

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (2)

The symmetric (2k, k)-graphs ⋮ High connectivity keeping sets in graphs and digraphs

Cites Work

• Unnamed Item
• On locally \(k\)-critically \(n\)-connected graphs
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• On \(k\)-critical connected line graphs
• On k-critical, n-connected graphs
• Fragments in 2-critically \(n\)-connected graphs
• Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph
• On the existence of \((k,l)\)-critical graphs
• Domination-balanced graphs
• A Note on k-Critically n-Connected Graphs
• Fragments in kcritical n‐connected graphs

This page was built for publication: The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)