Über n-fach zusammenhängende Eckenmengen in Graphen

DOI10.1016/S0095-8956(78)80012-4zbMath0319.05123OpenAlexW2075720583MaRDI QIDQ1222660

W. Mader

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(78)80012-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

Duality Theorems for Blocks and Tangles in Graphs ⋮ Connectivity and tree structure in finite graphs ⋮ Packing cycles in undirected group-labelled graphs ⋮ On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks ⋮ Computing Minimum k-Connected m-Fold Dominating Set in General Graphs ⋮ Tangle-tree duality in abstract separation systems ⋮ Endlichkeitssätze für k-kritische Graphen ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors

Cites Work

• Zur Struktur minimal n-fach zusammenhängender Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Schnittverbände in Graphen. (Intersection lattices in graphs)
• A Theorem on Planar Graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Minimally 2-connected graphs.
• A theorem on n-connected graphs
• On Minimal Blocks
• Cycles and Connectivity in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Über n-fach zusammenhängende Eckenmengen in Graphen