On locally k-critically n-connected graphs

DOI10.1016/0012-365X(93)90575-EzbMATH Open0788.05064MaRDI QIDQ687120FDOQ687120

Authors: Jianji Su 

Publication date: 30 May 1994

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

Recommendations

• scientific article; zbMATH DE number 3885951
• On \(k\)-con-critically \(n\)-connected graphs
• On local connectivity of \(K_{2,p}\)-free graphs
• scientific article; zbMATH DE number 68915
• Critically \((k,k)\)-connected graphs
• On connected \((\gamma,k)\)-critical graphs
• On local connectivity of graphs
• Locally \(C^ k_ n\) graphs
• scientific article; zbMATH DE number 894705
• On local edge connected domination critical graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Title not available (Why is that?)
• On k-critical, n-connected graphs
• Fragments in 2-critically \(n\)-connected graphs
• Title not available (Why is that?)
• A Note on k-Critically n-Connected Graphs
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• A note on fragments in a locally \(k\)-critical \(n\)-connected graph.
• On \(k\)-critical connected line graphs
• On the existence of \((k,l)\)-critical graphs
• A local structure theorem on 5-connected graphs
• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Lower bounds for locally highly connected graphs
• High connectivity keeping sets in graphs and digraphs
• The symmetric (2k, k)-graphs

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

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