Polytopes, graphs, and complexes

DOI10.1090/S0002-9904-1970-12601-5zbMath0211.25001OpenAlexW2159185405MaRDI QIDQ5612292

Publication date: 1970

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1970-12601-5

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Three-dimensional polytopes (52B10) Gale and other diagrams (52B35)

Related Items

n-connectedness in pure 2-complexes, On Hamilton decompositions of prisms over simple 3-polytopes, Simplicial faces and sections of a convex polytope, The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices, Unnamed Item, 5-Connected Toroidal Graphs are Hamiltonian-Connected, Chords of longest circuits in locally planar graphs, The circumference of a graph with no \(K_{3,t}\)-minor, Linear conditions on the number of faces of manifolds with boundary, Every 4-Connected Graph with Crossing Number 2 is Hamiltonian, Graphs of polyhedra; polyhedra as graphs, Adjacency of vertices of the complete pre-order polytope, 2-connected spanning subgraphs with low maximum degree in locally planar graphs, Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs, Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators, On the circumference of 3-connected cubic triangle-free plane graphs, Construction of Barnette graphs whose large subgraphs are non-Hamiltonian, The Excess Degree of a Polytope, Geometria combinatoria e geometrie finite, Hamiltonian cycles in polyhedral maps, A generalized lower‐bound conjecture for simplicial polytopes, On 3‐polytopes with non‐Hamiltonian prisms, \([a,b\)-factors of graphs on surfaces], Lower bound theorems for general polytopes, Convex 4-valent polytopes, On a Minimality Property of Complexes, Non-Hamiltonian simple 3-polytopes having just two types of faces, 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles, Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Recent advances on the Hamiltonian problem: survey III, Bounds on the number of cycles of length three in a planar graph, Extending an extension of Grinberg's theorem, On two-factors of bipartite regular graphs, The matching extendability of surfaces, Shortness exponents for polytopes which are k-gonal modulo n, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, A counterexample to prism-Hamiltonicity of 3-connected planar graphs, Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs, Hamiltonian cycles in some family of cubic 3-connected plane graphs, Unnamed Item, CONTRACTIBLE HAMILTONIAN CYCLES IN POLYHEDRAL MAPS, Separability and Tight Enclosure of Point Sets, On face vectors and vertex vectors of convex polyhedra, The complexity of linear programming, Hamilton paths in toroidal graphs, 6-valent analogues of Eberhard's theorem, Neighborly combinatorial 3-manifolds with 9 vertices, Five-valent convex polyhedra with prescribed faces, The existence of certain planar maps, Unnamed Item, Hamiltonian circuits in simple 3-polytopes with up to 26 vertices, Pairs of Hamiltonian circuits in 5-connected planar graphs, What is on his mind?, A note on traversing specified vertices in graphs embedded with large representativity, Planar and infinite hypohamiltonian and hypotraceable graphs, Pairs of edge-disjoint Hamiltonian circuits, Über die Graphen der konvexend-dimensionalen Polytope, bei denen jede 2-Seite von einer geraden Anzahl von Kanten berandet wird, Connectivity, genus, and the number of components in vertex-deleted subgraphs, Rigidity and the lower bound theorem. I, Sphären mit wenigen Ecken, Eine graphentheoretische Kennzeichnung der Stapelpolytope, A new basis of polytopes, Rectangular products of lattices, Non-Hamiltonian non-Grinbergian graphs, Über 3-realisierbare Folgen mit beliebigen Sechseckzahlen, Hamiltonian properties of polyhedra with few 3-cuts. A survey, 2- and 3-factors of graphs on surfaces, Contractible Hamiltonian cycles in triangulated surfaces, 2-edge-Hamiltonian-connectedness of 4-connected plane graphs, Criticality of counterexamples to toroidal edge-Hamiltonicity, Combinatorial generation via permutation languages. II. Lattice congruences, Unnamed Item, A combinatorial Chern-Weil theorem for 2-plane bundles with even Euler characteristics, Non-Hamiltonian cubic planar maps, On shortness exponents of families of graphs, An existence theorem for simple convex polyhedra, The numbers of faces of simplicial polytopes, On the 2-factors of bicubic graphs, Some problems on polyhedra, On r-regular r-connected non-hamiltonian graphs, On the genus and connectivity of Hamiltonian graphs, Geometrical realisations of the simple permutoassociahedron by Minkowski sums, Hamiltonian circuits on simple 3-polytopes, Vertices missed by longest paths or circuits, Shortness exponents of families of graphs, Hamiltonian circuits in certain prisms, Sachs triangulations and infinite sequences of regular maps on given type, The toroidal analogue to Eberhard's theorem, Are all simple 4-polytopes Hamiltonian?, Disjoint paths, planarizing cycles, and spanning walks, Gale diagrams of convex polytopes and positive spanning sets of vectors, Unnamed Item, 4-connected projective-planar graphs are Hamiltonian-connected, Signed orders, choice probabilities, and linear polytopes

Cites Work