论文标题
表征$ 3 $ - 级别的半径，具有独特的实现
Characterising $3$-polytopes of radius one with unique realisation
论文作者
论文摘要
让$ f $为平面，$ 3 $连接的半径图$ p $顶点，$ a $ a $第三级。我们表征了此类图的所有单次学位序列，当$ a \ geq 3 $和$ p $相对于$ a $足够大。这补充了\ cite {mafpo4}的工作，以$ a \ leq 3 $。
Let $F$ be a planar, $3$-connected graph of radius one on $p$ vertices, with $a$ vertices of degree three. We characterise all unigraphic degree sequences for such graphs, when $a\geq 3$ and $p$ is large enough with respect to $a$. This complements the work of \cite{mafpo4} for $a\leq 3$.
