The following pages link to Polytopes, graphs, and complexes (Q5612292):
Displayed 50 items.
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- A new basis of polytopes (Q582295) (← links)
- Rectangular products of lattices (Q584293) (← links)
- On face vectors and vertex vectors of convex polyhedra (Q685585) (← links)
- A combinatorial Chern-Weil theorem for 2-plane bundles with even Euler characteristics (Q756789) (← links)
- Non-Hamiltonian cubic planar maps (Q759157) (← links)
- On shortness exponents of families of graphs (Q759158) (← links)
- An existence theorem for simple convex polyhedra (Q759399) (← links)
- Are all simple 4-polytopes Hamiltonian? (Q793051) (← links)
- Gale diagrams of convex polytopes and positive spanning sets of vectors (Q797150) (← links)
- Chords of longest circuits in locally planar graphs (Q854834) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor (Q859611) (← links)
- Graphs of polyhedra; polyhedra as graphs (Q864132) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- The matching extendability of surfaces (Q918993) (← links)
- n-connectedness in pure 2-complexes (Q1076041) (← links)
- On Hamilton decompositions of prisms over simple 3-polytopes (Q1079581) (← links)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)
- Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs (Q1124606) (← links)
- Convex 4-valent polytopes (Q1143017) (← links)
- Non-Hamiltonian simple 3-polytopes having just two types of faces (Q1145160) (← links)
- Bounds on the number of cycles of length three in a planar graph (Q1163566) (← links)
- Extending an extension of Grinberg's theorem (Q1164056) (← links)
- On two-factors of bipartite regular graphs (Q1164645) (← links)
- Shortness exponents for polytopes which are k-gonal modulo n (Q1169478) (← links)
- 6-valent analogues of Eberhard's theorem (Q1211056) (← links)
- Neighborly combinatorial 3-manifolds with 9 vertices (Q1211755) (← links)
- Five-valent convex polyhedra with prescribed faces (Q1213447) (← links)
- The existence of certain planar maps (Q1214429) (← links)
- Hamiltonian circuits in simple 3-polytopes with up to 26 vertices (Q1215510) (← links)
- Pairs of Hamiltonian circuits in 5-connected planar graphs (Q1218869) (← links)
- Planar and infinite hypohamiltonian and hypotraceable graphs (Q1223315) (← links)
- Pairs of edge-disjoint Hamiltonian circuits (Q1227753) (← links)
- Connectivity, genus, and the number of components in vertex-deleted subgraphs (Q1233441) (← links)
- Sphären mit wenigen Ecken (Q1234086) (← links)
- Eine graphentheoretische Kennzeichnung der Stapelpolytope (Q1234087) (← links)
- Non-Hamiltonian non-Grinbergian graphs (Q1237752) (← links)
- Über 3-realisierbare Folgen mit beliebigen Sechseckzahlen (Q1238142) (← links)
- Linear conditions on the number of faces of manifolds with boundary (Q1364327) (← links)
- Adjacency of vertices of the complete pre-order polytope (Q1377754) (← links)
- Sachs triangulations and infinite sequences of regular maps on given type (Q1584414) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- Some problems on polyhedra (Q1822357) (← links)
- Hamilton paths in toroidal graphs (Q2485945) (← links)
- The numbers of faces of simplicial polytopes (Q2543941) (← links)
- On the 2-factors of bicubic graphs (Q2546880) (← links)
- On the genus and connectivity of Hamiltonian graphs (Q2551470) (← links)
- Hamiltonian circuits on simple 3-polytopes (Q2556413) (← links)
- Vertices missed by longest paths or circuits (Q2560260) (← links)
- Shortness exponents of families of graphs (Q2561232) (← links)