Abstract
This chapter provides an introduction to some of the graph theory associated with knots and links. The connection arises from the description of the shadow of a link diagram as a 4-valent plane graph. The link diagram is determined by a particular eulerian tour in this graph, and consequently many operations on link diagrams translate to operations on eulerian tours in plane graphs. The study of eulerian tours in 4-valent plane graphs leads naturally to the study of a number of interesting combinatorial objects, such as double occurrence words, chord diagrams, circle graphs, and maps. Questions that are motivated by the theory of knots and links can often be clarified or solved by being reformulated as a question in one of these different contexts.
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.
