论文标题
多面体图的独立数
Independence numbers of polyhedral graphs
论文作者
论文摘要
多面体图是$ 3 $连接的平面图。我们发现最不可能的订单$ p（k，a）$的多面体图，其中包含$ k $独立的尺寸$ a $，用于所有正整数$ k $和$ a $。在情况下，$ k = 1 $和$ a $偶数，我们证明了极端图是最大平面图的顶点（radial）图。
A polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive integers $k$ and $a$. In the case $k = 1$ and $a$ even, we prove that the extremal graphs are exactly the vertex-face (radial) graphs of maximal planar graphs.
