Characterising $3$-polytopes of radius one with unique realisation
Combinatorics
2022-07-07 v1
Abstract
Let be a planar, -connected graph of radius one on vertices, with vertices of degree three. We characterise all unigraphic degree sequences for such graphs, when and is large enough with respect to . This complements the work of \cite{mafpo4} for .
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}
}