A theorem on n-connected graphs

DOI10.1016/S0021-9800(69)80049-9zbMath0172.25803OpenAlexW2073586409MaRDI QIDQ5560179

Rudolf Halin

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80049-9

zbMATH Keywords

topology

Related Items (50)

n-connectedness in pure 2-complexes ⋮ On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ On Vertices of outdegree n in minimally n‐connected digraphs ⋮ Unnamed Item ⋮ A constructive characterization of 4-connected graphs ⋮ On some extremal connectivity results for graphs and matroids ⋮ On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups ⋮ On local structure of 9- and 10-connected 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 ⋮ Note on Halin's theorem on minimally connected graphs ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Uniformly connected graphs ⋮ Network disruption and the common-enemy effect ⋮ Properly 3-contractible edges in a minimally 3-connected graph ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ An upper bound for the minimum degree of a graph ⋮ Quelques problèmes de connexite dans les graphes orientes ⋮ Contractible edges in some k-connected graphs ⋮ Contractible edges in minimally \(k\)-connected graphs ⋮ Local structure of 5- and 6-connected graphs ⋮ Local structure of 7- and 8-connected graphs ⋮ A classification of 4-connected graphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Über n-fach zusammenhängende Eckenmengen in Graphen ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ Sparse graph certificates for mixed connectivity ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ Graph theory ⋮ Zur Struktur minimal n-fach zusammenhängender Graphen ⋮ Soldering and point splitting ⋮ Zur Theorie der n-fach zusammenhängenden Graphen ⋮ Minimale \(n\)-fach kantenzusammenhängende Graphen ⋮ Eine Eigenschaft der Atome endlicher Graphen ⋮ Eine Eigenschaft der Atome endlicher Graphen ⋮ Ecken n-ten Grades in minimalen n-fach zusammenhängenden Graphen ⋮ Unendliche minimale \(n\)-fach zusammenhängende Graphen ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs ⋮ Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen ⋮ Analyse und Synthese zuverlässiger Netze ⋮ Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte ⋮ Unnamed Item ⋮ 1-Faktoren von Graphen. (1-factors of graphs) ⋮ Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische Graphen ⋮ Contractible edges and triangles in \(k\)-connected graphs ⋮ Pendant tree-connectivity ⋮ Connectedness strength of two vertices in an uncertain graph ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) ⋮ Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs) ⋮ Extremal results for directed tree connectivity

This page was built for publication: A theorem on n-connected graphs