scientific article; zbMATH DE number 4181381

MaRDI QIDQ3204497zbMATH OpenFDO

Authors W. Mader

Publication date 1990

zbMATH Keywords

critically-connected graphsinfinite graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

Recommendations

• High connectivity keeping sets in \(n\)-connected graphs
• On \(k\)-con-critically \(n\)-connected graphs
• Large k‐preserving sets in infinite graphs
• scientific article; zbMATH DE number 3885951
• Characterising \(k\)-connected sets in infinite graphs

Cited in

(21)

• Gallai-Milgram properties for infinite graphs
• Infinite connected graphs with no end-preserving spanning trees
• A note on intertwines of infinite graphs
• On arithmetic infinite graphs
• About the Gordian graph at infinity
• A characterization of \(n\)-component graphs
• An infinite class of Neumaier graphs and non-existence results
• Characterising \(k\)-connected sets in infinite graphs
• Distinguishing infinite graphs
• High connectivity keeping sets in graphs and digraphs
• Buser's inequality on infinite graphs
• scientific article; zbMATH DE number 6503891 (Why is no real title available?)
• scientific article; zbMATH DE number 15670 (Why is no real title available?)
• Minimization Problems for Infinite n-Connected Graphs
• scientific article; zbMATH DE number 653248 (Why is no real title available?)
• Infinite graphs with finite 2-distinguishing cost
• Graphoidally independent infinite graphs
• A Riemann-Roch Theorem on Infinite Graphs
• n-arc connected graphs
• Unavoidable topological minors of infinite graphs
• High connectivity keeping sets in \(n\)-connected graphs

This page was built for publication:

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