English

Characterising $3$-polytopes of radius one with unique realisation

Combinatorics 2022-07-07 v1

Abstract

Let FF be a planar, 33-connected graph of radius one on pp vertices, with aa vertices of degree three. We characterise all unigraphic degree sequences for such graphs, when a3a\geq 3 and pp is large enough with respect to aa. This complements the work of \cite{mafpo4} for a3a\leq 3.

Keywords

Cite

@article{arxiv.2207.02725,
  title  = {Characterising $3$-polytopes of radius one with unique realisation},
  author = {Riccardo W. Maffucci},
  journal= {arXiv preprint arXiv:2207.02725},
  year   = {2022}
}