On locally \(k\)-critically \(n\)-connected graphs

DOI10.1016/0012-365X(93)90575-EzbMath0788.05064MaRDI QIDQ687120

Jianji Su

Publication date: 30 May 1994

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

zbMATH Keywords

\(k\)-critically \(n\)-connected graphSlater's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (6)

On the existence of \((k,l)\)-critical graphs ⋮ The symmetric (2k, k)-graphs ⋮ On \(k\)-critical connected line graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ High connectivity keeping sets in graphs and digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• On k-critical, n-connected graphs
• Fragments in 2-critically \(n\)-connected graphs
• A Note on k-Critically n-Connected Graphs

This page was built for publication: On locally \(k\)-critically \(n\)-connected graphs