首页> 中文期刊> 《数学学报(英文版)》 >Drawing Complete Multipartite Graphs on the Plane with Restrictions on Crossings

Drawing Complete Multipartite Graphs on the Plane with Restrictions on Crossings

         

摘要

A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge.A plane graph with near independent crossings(say NIC-planar graph) is a 1-planar graph with the restriction that for any two crossings the four crossed edges are incident with at most one common vertex.The full characterization of NIC-planar complete and complete multipartite graphs is given in this paper.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号