Graphs of polyhedra; polyhedra as graphs
From MaRDI portal
Publication:864132
DOI10.1016/j.disc.2005.09.037zbMath1111.51018OpenAlexW1979306170WikidataQ56047069 ScholiaQ56047069MaRDI QIDQ864132
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1773/2276
polygonconvex polyhedronabstract polyhedron3-connected planar graphsnonconvex polyhedronSteinitz's Theorem
Three-dimensional polytopes (52B10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (11)
Morphic Polytopes and Symmetries ⋮ On local operations that preserve symmetries and on preserving polyhedrality of maps ⋮ Independence numbers of polyhedral graphs ⋮ 3D geo-graphs: efficient flip verification for the spherical zoning problem ⋮ Hess' law requires modified mathematical rules for information entropy of interdependent chemical reactions ⋮ On the construction of planar embedding for a class of orthogonal polyhedra ⋮ Word choice in mathematical practice: a case study in polyhedra ⋮ Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra ⋮ Nets with collisions (unstable nets) and crystal chemistry ⋮ Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph ⋮ Dissecting the square into seven or nine congruent parts
Cites Work
- On face vectors and vertex vectors of convex polyhedra
- An existence theorem for simple convex polyhedra
- How to cage an egg
- A combinatorial theory of Grünbaum's new regular polyhedra. II: Complete enumeration
- Completely classifying all vertex-transitive and edge-transitive polyhedra. I: Necessary class conditions
- Five-valent convex polyhedra with prescribed faces
- Regular polyhedra - old and new
- On combinatorial papers of König and Steinitz
- Resolvable representation of polyhedra
- Regular polytopes in ordinary space
- Isogonal prismatoids
- On the generation of oriented matroids
- A combinatorial theory of Gruenbaum's new regular polyhedra. I: Gruenbaum's new regular polyhedra and their automorphism group
- How to exhibit toroidal maps in space
- Some semicontinuity theorems for convex polytopes and cell-complexes
- Automorphismen von polyedrischen Graphen
- Longest Simple Paths in Polyhedral Graphs
- Lectures on Polytopes
- Abstract Regular Polytopes
- Representations of Planar Graphs
- Trees in Polyhedral Graphs
- Polytopes, graphs, and complexes
- Uniform polyhedra
- Isohedral deltahedra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs of polyhedra; polyhedra as graphs
