Drawing complete multipartite graphs on the plane with restrictions on crossings

2013/11/08 by Xin Zhang, Zhang, Xin
Computer Science · Engineering · Mathematics · #05C62 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #graph theory and CDMA systems #math.CO #msc:05C62 #msc:68R10

paper · pdf · doi:10.48550/arxiv.1311.1994

arxiv created 2013/11/08 · openalex publication_date 2013/11/08 · arxiv updated 2013/11/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce the concept of NIC-planar graphs and present the full characterization of NIC-planar complete k-partite graphs.

Related

• NIC-Planar Graphs
• A Note on IC-Planar Graphs
• Recognizing IC-Planar and NIC-Planar Graphs
• Drawing Partially Embedded and Simultaneously Planar Graphs
• On plane cycles in geometric multipartite graphs