Every polyhedron is classified by its set of pair common-neighbour counts, with a complete trichotomy for every finite set of counts.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Classification of polyhedral graphs by numbers of common neighbours
Every polyhedron is classified by its set of pair common-neighbour counts, with a complete trichotomy for every finite set of counts.