Zur Theorie der n-fach zusammenhängenden Graphen

DOI10.1007/BF02992931zbMath0172.25802MaRDI QIDQ2532130

Rudolf Halin

Publication date: 1969

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items

n-connectedness in pure 2-complexes, Path-connectivity in graphs, Contractible edges in longest cycles in non-Hamiltonian graphs, Contractible edges in 3-connected graphs, Unnamed Item, On some extremal connectivity results for graphs and matroids, On 3-connected matroids, Cyclic coloring of plane graphs with maximum face size 16 and 17, Contractible Edges in 3-Connected Cubic Graphs, Critical vertices in \(k\)-connected digraphs, Non-separating induced cycles in graphs, Cycle traversability for claw-free graphs and polyhedral maps, An 11-vertex theorem for 3-connected cubic graphs, Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge, Another step towards proving a conjecture by Plummer and Toft, Contractible edges and removable edges in 3-connected graphs, A tight bound on the collection of edges in MSTs of induced subgraphs, Contractible edges and contractible triangles in a 3-connected graph, A general upper bound for the cyclic chromatic number of 3‐connected plane graphs, Characterizations of n-connected and n-line connected graphs, On the connectivity of infinite graphs and 2-complexes, Excluding a ladder, High connectivity keeping sets in graphs and digraphs, Contractible subgraphs in 3-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Über trennende Eckenmengen in Graphen und den Mengerschen Satz
• Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
• Bemerkungen über ebene Graphen
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• Minimally 2-connected graphs.
• A theorem on n-connected graphs