Alternating knot diagrams, Euler circuits and the interlace polynomial

DOI10.1006/eujc.2000.0434zbMath0968.05035OpenAlexW2002583508MaRDI QIDQ1840823

Béla Bollobás, P. N. Ballister, Alexander D. Scott, Oliver Riordan

Publication date: 18 September 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2000.0434

zbMATH Keywords

interlace polynomialEuler circuitsknot diagrams

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Kauffman–Harary conjecture for alternating virtual knots ⋮ A NEW PROOF THAT ALTERNATING LINKS ARE NON-TRIVIAL ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ The interlace polynomial of a graph ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, I ⋮ Classical results for alternating virtual links

Cites Work

• A spanning tree expansion of the Jones polynomial
• State models and the Jones polynomial
• Jones polynomials and classical conjectures in knot theory
• The Color Invariant for Knots and Links
• A geometric proof that alternating knots are non-trivial
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating knot diagrams, Euler circuits and the interlace polynomial