Abstract
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. We present the full characterization of 1-planar complete k-partite graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
