Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen

DOI10.1007/BF01350174zbMath0184.27601OpenAlexW2381070482MaRDI QIDQ2535846

Heinz A. Jung

Publication date: 1970

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

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

zbMATH Keywords

topology

Related Items (48)

Even cycles in directed graphs ⋮ Linkage for the diamond and the path with four vertices ⋮ Combined Degree and Connectivity Conditions for $H$-Linked Graphs ⋮ The structure of graphs not topologically containing the Wagner graph ⋮ Nonseparating Cycles Avoiding Specific Vertices ⋮ Polytopes, graphs, and complexes ⋮ On Modulo Linked Graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Linking four vertices in graphs of large connectivity ⋮ Obstructions for the Disk and the Cylinder Embedding Extension Problems ⋮ Rooted \(K_4\)-minors ⋮ Bonds with parity constraints ⋮ Rainbow clique subdivisions ⋮ A graph minor condition for graphs to be \(k\)-linked ⋮ Topological minors in graphs of large girth ⋮ On low degree \(k\)-ordered graphs ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ Optimal connectivity for fat-triangle linkages ⋮ 2-linked graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Local Conditions for Exponentially Many Subdivisions ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Improved results on linkage problems ⋮ Random lifts of graphs are highly connected ⋮ On large semi-linked graphs ⋮ Linkedness and Ordered Cycles in Digraphs ⋮ Linked graphs with restricted lengths ⋮ Highly linked tournaments ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ The extremal function for 3-linked graphs ⋮ A new proof of the flat wall theorem ⋮ Linkability in iterated line graphs ⋮ An improved linear edge bound for graph linkages ⋮ The extremal function for \(K_{9}\) minors ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ On \(H\)-linked graphs ⋮ 7-connected graphs are 4-ordered ⋮ Removable cycles in non-bipartite graphs ⋮ On linkages in polytope graphs ⋮ Minimum degree condition for a graph to be knitted ⋮ The extremal function for \(K_{8}^{-}\) minors ⋮ Highly linked tournaments with large minimum out-degree ⋮ Connectivity for Kite-Linked Graphs ⋮ Pendant tree-connectivity ⋮ Rooted topological minors on four vertices ⋮ Extremal connectivity for topological cliques in bipartite graphs ⋮ Subdivisions of a large clique in \(C_6\)-free graphs ⋮ The Price of Connectivity in Fair Division

Cites Work

• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• On the existence of certain disjoint arcs in graphs
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

This page was built for publication: Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen