Constructing certain families of 3‐polytopal graphs

DOI10.1002/jgt.22882zbMath1522.05471arXiv2105.00022OpenAlexW4293761302MaRDI QIDQ6046684

Riccardo W. Maffucci

Publication date: 6 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

algorithmpolyhedronplanar graphdegree sequence3-polytopevalency

Mathematics Subject Classification ID

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) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (1)

Self-dual polyhedra of given degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On face vectors and vertex vectors of convex polyhedra
• An existence theorem for simple convex polyhedra
• On valences of polyhedra
• Polyhedra with 4 to 8 faces
• Some analogues of Eberhard's theorem on convex polytopes
• On Planar Graphical Degree Sequences
• On Sums of Valencies in Planar Graphs
• On Certain Polyhedra
• On p-vectors of 3-polytopes

This page was built for publication: Constructing certain families of 3‐polytopal graphs