首页 | 本学科首页   官方微博 | 高级检索  
     


No optimal 1‐planar graph triangulates any nonorientable closed surface
Abstract:Suzuki [Discrete Math. 310 (2010), 6–11] proved that for any orientable closed surface F2 other than the sphere, there exists an optimal 1‐planar graph which can be embedded on F2 as a triangulation. However, for nonorientable closed surfaces, the existence of such graphs is unknown. In this article, we prove that no optimal 1‐planar graph triangulates a nonorientable closed surface.
Keywords:closed surface  optimal 1‐planar graph  triangulation
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号