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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bouchet, Unimodularity and circle graphs, Discrete Math., 66 (1987), 203–208.
H. de Fraysseix, Local complementation and interlacement graphs, Discrete Math., 33 (1981), 29–35.
H. de Fraysseix and P. Ossona De Mendez, On a characterization of Gauss codes, Discrete Comput. Geom., 22 (1999), 287–295.
G. Kuperberg, An exploration of the permanent-determinant method, Electron. J. Combin., 5 (1998), Research Paper 46, 34 pp. (electronic).
M. Las Vergnas, Eulerian circuits of A-valent graphs imbedded in surfaces, in Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), North-Holland, Amsterdam, 1981, 451–477.
S. Lins, Graph-encoded maps, J. Combin. Theory Ser. B, 32 (1982), 171–181.
R. C. Read and P. Rosenstiehl, On the Gauss crossing problem, in Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, North-Holland, Amsterdam, 1978, 843–876.
H. Shank, The theory of left-right paths, Lecture Notes in Math., 452 (1975), 42–54.
A. Vince, Combinatorial maps, J. Combin. Theory Ser. B, 34 (1983), 1–21.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Godsil, C., Royle, G. (2001). Knots and Eulerian Cycles. In: Algebraic Graph Theory. Graduate Texts in Mathematics, vol 207. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0163-9_17
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0163-9_17
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95220-8
Online ISBN: 978-1-4613-0163-9
eBook Packages: Springer Book Archive