Abstract
AbstractIn [Adams, 1994; The Knot Book], Colin Adams states as an open question whether removing a vertex and all edges incident to that vertex from an intrinsically knotted graph must yield an intrinsically linked graph. In this paper, we exhibit an intrinsically knotted graph for which there is a vertex that can be removed, and the resulting graph is not intrinsically linked. We further show that this graph is minor minimal with respect to being intrinsically knotted. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 199–209, 2003
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.
