Self-dual polyhedra of given degree sequence

DOI10.26493/2590-9770.1537.cf9zbMath1502.05234arXiv2108.01058OpenAlexW3188458238MaRDI QIDQ5058165

Riccardo W. Maffucci

Publication date: 19 December 2022

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.01058

zbMATH Keywords

algorithmpolyhedronself-dualdegree sequencequadrangulationradial graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Vertex degrees (05C07)

Related Items (1)

Independence numbers of polyhedral graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An inductive definition of the class of 3-connected quadrangulations of the plane
• Polyhedra with 4 to 8 faces
• Self-dual maps on the sphere
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Connected rigidity matroids and unique realizations of graphs
• The 24 symmetry pairings of self-dual maps on the sphere
• Polyhedra of small order and their Hamiltonian properties
• Self-dual graphs
• Generic global rigidity
• Generation of simple quadrangulations of the sphere
• Conditions for Unique Graph Realizations
• One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory
• Constructing certain families of 3‐polytopal graphs

This page was built for publication: Self-dual polyhedra of given degree sequence