Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
From MaRDI portal
Publication:2549705
Cites work
Cited in
(20)- Ear‐decompositions, minimally connected matroids and rigid graphs
- Uniformly 3‐connected graphs
- On minimally \((n,\lambda)\)-connected graphs
- Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
- On mixed connectivity certificates
- Zur Struktur minimal n-fach zusammenhängender Graphen
- Endlichkeitssätze für k-kritische Graphen
- Kantendisjunkte Wege in Graphen
- Extremal infinite graph theory
- Locally finite graphs with ends: A topological approach. II: Applications
- Minimally globally rigid graphs
- Minimally k-connected graphs of low order and maximal size
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- On minimally highly vertex-redundantly rigid graphs
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- On mixed connectivity certificates
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Minimization Problems for Infinite n-Connected Graphs
This page was built for publication: Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549705)
