Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)

DOI10.1007/BF01304933zbMath0228.05119MaRDI QIDQ2549705

W. Mader

Publication date: 1972

Published in: Archiv der Mathematik (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Minimization Problems for Infinite n-Connected Graphs, On the spectral radius of minimally 2-(edge)-connected graphs with given size, Connectivity preserving trees in k‐connected or k‐edge‐connected graphs, Uniformly 3‐connected graphs, Ear‐decompositions, minimally connected matroids and rigid graphs, Constrained surface-level gateway placement for underwater acoustic wireless sensor networks, On mixed connectivity certificates, Locally finite graphs with ends: A topological approach. II: Applications, Endlichkeitssätze für k-kritische Graphen, Extremal infinite graph theory, On minimally highly vertex-redundantly rigid graphs, Zur Struktur minimal n-fach zusammenhängender Graphen, On mixed connectivity certificates, Kantendisjunkte Wege in Graphen, Minimally k-connected graphs of low order and maximal size, On minimally \((n,\lambda)\)-connected graphs, Minimally globally rigid graphs, Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs), Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen

Cites Work

• Unnamed Item
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Minimally 2-connected graphs.
• Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.