Alternating knot diagrams, Euler circuits and the interlace polynomial
From MaRDI portal
Publication:1840823
DOI10.1006/eujc.2000.0434zbMath0968.05035MaRDI QIDQ1840823
Béla Bollobás, Oliver Riordan, Alexander D. Scott, P. N. Ballister
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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Distance Hereditary Graphs and the Interlace Polynomial, A BRACKET POLYNOMIAL FOR GRAPHS, I, The interlace polynomial of a graph, A NEW PROOF THAT ALTERNATING LINKS ARE NON-TRIVIAL
Cites Work