On unigraphic 3-polytopes of radius one
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 p≤ 17, and those with q≤ 41 edges, by developing a fast algorithm and making use of High Performance Computing.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.