scientific article; zbMATH DE number 4181381

zbMATH Open0717.05051MaRDI QIDQ3204497FDOQ3204497

W. Mader

Publication date: 1990

Title of this publication is not available (Why is that?)

zbMATH Keywords

infinite graphscritically-connected graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

Cited In (17)

• High connectivity keeping sets in \(n\)-connected graphs
• Title not available (Why is that?)
• About the Gordian graph at infinity
• A note on intertwines of infinite graphs
• Graphoidally independent infinite graphs
• A Riemann-Roch Theorem on Infinite Graphs
• Distinguishing infinite graphs
• Gallai-Milgram properties for infinite graphs
• Buser's inequality on infinite graphs
• High connectivity keeping sets in graphs and digraphs
• Title not available (Why is that?)
• Infinite graphs with finite 2-distinguishing cost
• Title not available (Why is that?)
• Infinite connected graphs with no end-preserving spanning trees
• On arithmetic infinite graphs
• Minimization Problems for Infinite n-Connected Graphs
• An infinite class of Neumaier graphs and non-existence results

   Recommendations

• High connectivity keeping sets in \(n\)-connected graphs 👍 👎
• On \(k\)-con-critically \(n\)-connected graphs 👍 👎
• Large k‐preserving sets in infinite graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Characterising \(k\)-connected sets in infinite 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)