On unigraphic 3-polytopes of radius one

MaRDI QIDQ6404048zbMATH OpenFDO

Authors Riccardo W. Maffucci

Publication date 5 July 2022

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Vertex degrees (05C07) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Abstract: We ask which degree sequences admit a unique realisation as a $3$-polytopal graph (polyhedron) on $p$ vertices. We give an exhaustive list of these sequences for the case where one degree equals $p-1$ and exactly two or three of them equal $3$. We also find all $3$-polytopes of radius one with $pleq17$, and those with $qleq41$ edges, by developing a fast algorithm and making use of High Performance Computing.

This page was built for publication: On unigraphic $3$-polytopes of radius one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404048)