Drawing complete multipartite graphs on the plane with restrictions on crossings
classification
🧮 math.CO
cs.DM
keywords
graphscompletenic-planarcharacterizationconceptcrossingsdrawingfull
read the original abstract
We introduce the concept of NIC-planar graphs and present the full characterization of NIC-planar complete k-partite graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.