加载中…
A -nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly numbers of its faces have the same length. It is proved that there is no 2-connected -nearly platonic graph. In this paper, we prove that there is no -nearly platonic graph.

生成讲解博客的中文版本

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