Every minimum-order 3-polytopal graph with all degrees 3..n (n≥14) is asymmetric, and automorphism groups are classified for four other extremal polyhedral families.
Title resolution pending
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Automorphism Groups in Extremal Families of Polyhedral Graphs
Every minimum-order 3-polytopal graph with all degrees 3..n (n≥14) is asymmetric, and automorphism groups are classified for four other extremal polyhedral families.