加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本