Eine Eigenschaft der Atome endlicher Graphen
From MaRDI portal
Publication:5921267
DOI10.1007/BF01222585zbMath0214.51503MaRDI QIDQ5921267
Publication date: 1971
Published in: Archiv der Mathematik (Search for Journal in Brave)
05C99: Graph theory
Related Items
An upper bound for the minimum degree of a graph, Contractibility and the Hadwiger conjecture, Connectivity keeping edges in graphs with large minimum degree, A note on the girth of digraphs, Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen, Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs), 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\)], Vertices of small degree in critically \(n\)-connected digraphs, Structure of vertex-transitive graphs, Endlichkeitssätze für k-kritische Graphen, On the connectivities of finite and infinite graphs, Intersections of longest cycles in \(k\)-connected graphs, The facets and the symmetries of the approval-voting polytope, Subsets with a small sum. II: The critical pair problem, On the connectivity of Cayley digraphs, A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph, Cayley digraphs and graphs, Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische Graphen, Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors, Connectivity keeping paths in k-connected graphs, Existence of openly disjoint circuits through a vertex
Cites Work
