Abstract
An embedding of a graph into a space is linear if each edge is a straight line segment. In 1991, Negami showed that for any given knot, link, or spatial graph there is a sufficiently large complete graph Kn such that every linear embedding of Kn into a space always contains that knot, link, or spatial graph. This paper generalizes this result to cover complete bipartite graphs. The results for complete multipartite graphs and for complete graphs are obtained as corollaries.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
