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

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

David 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

Related Items

On Modulo Linked Graphs, Polytopes, graphs, and complexes, 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, 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., An improved linear edge bound for graph linkages, 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, Triangles n-Connectivity in Simplicial 2-Complexes