加载中…
A -polytope is a -connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other -polytope, up to graph isomorphism. The classification of unigraphic -polytopes appears to be a difficult problem. In this paper we prove that, apart from pyramids, all unigraphic -polytopes have no -gonal faces for . Our method involves defining several planar graph transformations on a given -polytope containing an -gonal face with . The delicate part is to prove that, for every such -polytope, at least one of these transformations both preserves -connectivity, and is not an isomorphism.

生成讲解博客的中文版本

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