Abstract
A graph is 1-embeddable on a closed surface if there exists a drawing of the graph on the surface such that each edge crosses at most one other edge at a point. In this paper, we determine all the 1-embeddable complete k-partite graphs on the projective plane.
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
