Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen

DOI10.1007/BF01350321zbMath0172.25804MaRDI QIDQ2532131

Rudolf Halin

Publication date: 1969

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/161860

zbMATH Keywords

topology

Related Items (21)

Minimally 3-connected graphs ⋮ Elements belonging to triads in 3-connected matroids ⋮ Contractible edges in 3-connected graphs ⋮ Small Cocircuits in Minimally Vertically 4-Connected Matroids ⋮ Reduction for 3-connected graphs of minimum degree at least four ⋮ Unnamed Item ⋮ Generalizaions of critical connectivity of graphs ⋮ On some extremal connectivity results for graphs and matroids ⋮ On the number of triangles in 3-connected matroids ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Splitting and contractible edges in 4-connected graphs ⋮ On Connectivity in Matroids and Graphs ⋮ Elements belonging to triangles in 3-connected matroids ⋮ On two dual classes of planar graphs ⋮ On the number of contractible triples in 3-connected graphs ⋮ The number of elements belonging to triads in 3-connected binary matroids ⋮ On minimally \(k\)-connected matroids ⋮ On obstructions to small face covers in planar graphs ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ An extremal problem on contractible edges in 3-connected graphs ⋮ Excluding a ladder

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über trennende Eckenmengen in Graphen und den Mengerschen Satz
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• Minimally 2-connected graphs.

This page was built for publication: Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen