Zur Struktur minimal n-fach zusammenhängender Graphen
From MaRDI portal
Publication:1256495
DOI10.1007/BF02950646zbMath0404.05041OpenAlexW2320477734MaRDI QIDQ1256495
Publication date: 1979
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02950646
Related Items (17)
The tree of cuts and minimal \(k\)-connected graphs ⋮ Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\) ⋮ On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ On Vertices of outdegree n in minimally n‐connected digraphs ⋮ Small Cocircuits in Minimally Vertically 4-Connected Matroids ⋮ On some extremal connectivity results for graphs and matroids ⋮ A constructive characterization of 3-connected triangle-free graphs ⋮ On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Uniformly connected graphs ⋮ Minimal biconnected graphs ⋮ On minimally \(k\)-connected matroids ⋮ Über n-fach zusammenhängende Eckenmengen in Graphen ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ Edge disjoint Steiner trees in graphs without large bridges ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) ⋮ Gabriel andrew dirac
Cites Work
- Unnamed Item
- Über trennende Eckenmengen in Graphen und den Mengerschen Satz
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- Schnittverbände in Graphen. (Intersection lattices in graphs)
- Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
- A theorem on n-connected graphs
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
This page was built for publication: Zur Struktur minimal n-fach zusammenhängender Graphen
