On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

DOI10.1112/plms/s3-20.1.144zbMath0201.56801OpenAlexW2054740829MaRDI QIDQ5600748

Publication date: 1970

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-20.1.144

Related Items (40)

n-connectedness in pure 2-complexes ⋮ Even cycles in directed graphs ⋮ Linkage for the diamond and the path with four vertices ⋮ Linkages in Polytope Graphs ⋮ 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 ⋮ The subgraph homeomorphism problem ⋮ A graph minor condition for graphs to be \(k\)-linked ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ The linkedness of cubical polytopes: beyond the cube ⋮ Optimal connectivity for fat-triangle linkages ⋮ 2-linked graphs ⋮ Complete subgraphs of the graphs of convex polytopes ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Improved results on linkage problems ⋮ Random lifts of graphs are highly connected ⋮ Decompositions of homology manifolds and their graphs ⋮ The isomorphism problem for classes of graphs closed under contraction ⋮ Linked graphs with restricted lengths ⋮ Highly linked tournaments ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ Three-regular path pairable graphs ⋮ The extremal function for 3-linked graphs ⋮ Linkability in iterated line graphs ⋮ An improved linear edge bound for graph linkages ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ The linkedness of cubical polytopes: the cube ⋮ On linkages in polytope graphs ⋮ Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen ⋮ Disjoint shortest paths in graphs ⋮ Minimum degree condition for a graph to be knitted ⋮ Highly linked graphs ⋮ Highly linked tournaments with large minimum out-degree ⋮ Connectivity for Kite-Linked Graphs ⋮ Pendant tree-connectivity ⋮ Rooted topological minors on four vertices ⋮ Disjoint edge paths between given vertices of a convex polytope ⋮ Triangles n-Connectivity in Simplicial 2-Complexes

This page was built for publication: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes