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

DOI10.1112/PLMS/S3-20.1.144MaRDI QIDQ5600748zbMATH OpenOpenAlexFDO

Authors D. G. Larman, P. Mani-Levitska

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

Cited in

(44)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5600748)