Eine Eigenschaft der Atome endlicher Graphen

DOI10.1007/BF01222585zbMath0214.51503MaRDI QIDQ5921267

W. Mader

Publication date: 1971

Published in: Archiv der Mathematik (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (24)

The facets and the symmetries of the approval-voting polytope ⋮ Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) ⋮ Intersections of longest cycles in \(k\)-connected graphs ⋮ An upper bound for the minimum degree of a graph ⋮ On multiply critically h-connected graphs ⋮ An application of connectivity theory in graphs to factorizations of elements in groups ⋮ Connectivity of minimal Cayley graphs ⋮ Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)] ⋮ Subsets with a small sum. II: The critical pair problem ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Existence of openly disjoint circuits through a vertex ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph ⋮ Structure of vertex-transitive graphs ⋮ On the connectivity of Cayley digraphs ⋮ Contractibility and the Hadwiger conjecture ⋮ Endlichkeitssätze für k-kritische Graphen ⋮ Connectivity keeping paths in k-connected graphs ⋮ Cayley digraphs and graphs ⋮ On the connectivities of finite and infinite graphs ⋮ Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische Graphen ⋮ A note on the girth of digraphs ⋮ Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen

Cites Work

• A theorem on n-connected graphs
• Connectivity of transitive graphs

This page was built for publication: Eine Eigenschaft der Atome endlicher Graphen