The interlace polynomial of a graph

Journal of Combinatorial Theory. Series B

Volumn 92, Issue 2 SPEC. ISS., 2004, Pages 199-233

  Arratia, Richard ^a   Bollobás, Béla ^b,c   Sorkin, Gregory B ^d  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b University of Memphis   (United States)

^c TRINITY COLLEGE   (United Kingdom)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

BEST theorem; Circle graph; Circuit partition; Euler circuit; Extremal; Interlace graph; Kauffman bracket; Martin polynomial; Matrix tree theorem; Pairing; Tutte polynomial

Indexed keywords

EID: 9144227674     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2004.03.003     Document Type: Article

References (46)

1. Aigner M. van der Holst H. Interlace polynomials Linear Algebra Appl. 377 2004 11-30 (MR 2 021600)
2. Arratia R. Bollobás B. Coppersmith D. Sorkin G.B. Euler circuits and DNA sequencing by hybridization Discrete Appl. Math. 104 1-3 2000 63-96 (MR 2001i:92032)
3. R. Arratia B. Bollobás G.B. Sorkin The interlace polynomial: a new graph polynomial, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 2000, pp. 237-245
4. R. Arratia B. Bollobás G.B. Sorkin A two-variable interlace polynomial http://arxiv.org/ps/math.CO/0209054; 2001, to appear in Combinatorica
5. Balister P.N. Bollobás B. Cutler J. Pebody L. The interlace polynomial of graphs at-1 European J. Combin. 23 7 2002 761-767 (MR 2003h:05126)
6. Balister P.N. Bollobás B. Riordan O.M. Scott A.D. Alternating knot diagrams, Euler circuits and the interlace polynomial European J. Combin. 22 1 2001 1-4 (MR2002c:05055)
7. Bankwitz C. Über die Torsionzahlen der lternierenden Knoten Math. Ann. 103 1930 145-161
8. D. Bénard, A. Bouchet, A. Duchamp, On the Martin and Tuttle polynomials, Technical Report, Département d'Informatique, Université du Maine, Le Mans, France, May 1997
9. B. Bollobás Modern Graph Theory, Graduate Texts in Mathematics, Vol. 184, Springer, New York, 1998
10. Bollobás B. Evaluations of the circuit partition polynomial J. Combin. Theory Ser. B 85 2 2002 261-268 (MR 2003f:05066)
11. Bouchet A. Isotropic systems European J. Combin. 8 3 1987 231-244 (MR 89b:05066)
12. Bouchet A. Graphic presentations of isotropic systems J. Combin. Theory Ser. B 45 1 1998 58-76 (MR 89f:05150)
13. Bouchet A. Tutte-Martin polynomials and orienting vectors of isotropic systems Graphs combin. 7 3 1991 235-252 (MR 92i:05071).
14. A. Bouchet Multimatroids III. Tightness and fundamental graphs, Technical Report, Département d'Informatique, Université du Maine, Le Mans, France, September 1999
15. A. Bouchet Personal communication, September 2000
16. de Bruijn N.G. van Aardenne-Ehrenfest T. Circuits and trees in oriented graphs Simon Stevin 28 1951 203-217
17. de Fraysseix H. A characterization of circle graphs European J. Combin. 5 1984 223-238
18. Ellis-Monaghan J.A. New results for the Martin polynomial J. Combin. Theory Ser. B 74 2 1998 326-352 (MR 2000a:05109).
19. J.A. Ellis-Monaghan Martin polynomial miscellanea, Proceedings of the 30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1999, Vol. 137, 1999, pp. 19-31 (MR 2001a:05092)
20. Gabor C.P. Supowit K.J. Hsu W.-L. Recognizing circle graphs in polynomial time J. ACM 36 1989 435-473
21. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
22. Hoggar S. Chromatic polynomials and logarithmic concavity J. Combin. Theory (B) 16 1974 248-254
23. Jaeger F. On Tutte polynomials and cycles of plane graphs J. Combin. Theory Ser. B 44 2 1988 127-146 (MR 89b:05086).
24. Kauffman L.H. State models and the Jones polynomial Topology 26 3 1987 395-407 (MR 88f:57006).
25. Kauffman L.H. New invariants in the theory of knots Amer. Math. Monthly 95 3 1988 195-242 (MR 89d:57005).
26. Kirchoff G. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird Ann. Phys. Chem. 72 1847 497-508
27. A. Kotzig Eulerian lines in finite 4-valent graphs and their transformations, Theory of graphs, Proceedings of Colloquium Tihany, 1966, Academic Press, New York, 1968, pp. 219-230 (MR 40 #1298)
28. M. Las Vergnas Eulerian circuits of 4-valent graphs imbedded in surfaces, Algebraic Methods in Graph Theory, Szeged, Hungary, 1978, Colloquia Mathematica Sociatatis János Bolyni, Vol. 25, North-Holland, Amsterdam, 1981, pp. 45-477
29. Las Vergnas M. Le polynôme de Martin d'un graphe Eulerian Ann. Discrete Math. 17 1983 397-411
30. Las Vergnas M. On the evaluation at (3,3) of the Tutte polynomial of a graph J. Combin. Theory, Ser. B 44 1988 367-372
31. P. Martin Enumérations eulériennes dans les multigraphes et invariants de Tutte-Grothendieck, Ph. D. Thesis, Grenoble, 1977
32. Martin P. Remarkable valuation of the dichromatic polynomial of planar multigraphs J. Combin. Theory Ser. B 24 3 1978 318-324 (MR 58 #335).
33. Martin P. Remarkable valuation of the dichromatic polynomial of planar multigraphs J. Combin. Theory Ser. B 24 3 1978 318-324 (MR 58 #335).
34. Pevzner P. DNA physical mapping and alternating Eulerian circuits in colored graphs Algorithmica 13 1995 77-105
35. G. Pólya R.E. Tarjan D.R. Woods Notes on Introductory Combinatorics, Birkhäuser, Boston, MA, 1983 (MR 85k:05001)
36. Read R.C. An introduction to chromatic polynomials J. Combin. Theory 4 1968 52-71
37. R.C. Read P. Rosenstiehl On the Gauss crossing problem, in: A. Hajnal, V.T. Sós (Eds.), Combinatorics, Vol. 2, Colloquia Mathematica Sociatatis János Bolyni, Keszthely, Hungary, Vol. 18, North-Holland, Amsterdam, 1978, pp. 843-876
38. P. Rosensthiehl R.C. Read On the principal edge tripartition of a graph. in: B. Bollobás (Ed.), Advances in Graph Theory, Cambridge Combinatorial Conference, Trinity College, Cambridge, 1977, Annales of Discrete Mathematics, Vol. 3, 1978, pp. 195-226
39. Sato K.-I. Convolution of unimodal distributions can produce any number of modes Ann. Probab. 21 3 1992 1543-1549
40. Schwärzler W. The coefficients of the Tutte polynomial are not unimodal J. Combin. Theory Ser. B 58 2 1993 240-242 (MR 94e:05114).
41. Smith C.A.B. Tutte W.T. On unicursal paths in a network of degree 4 Amer. Math. Monthly 48 1941 233-237
42. Spinrad J. Recognition of circle graphs J. Algorithms 16 1994 264-282
43. Tutte W.T. The dissection of equilateral triangles into equilateral triangles Proc. Cambridge Philos. Soc. 44 1948 463-482
44. Ukkonen E. Approximate string-matching with q-grams and maximal matches Theoret. Comput. Sci. 92 1992 191-211
45. Welsh D.J.A. Complexity: Knots, Colourings, and Counting London Mathematical Society Lecture Notes Series Vol. 186 1993 Cambridge University Press Cambridge, England
46. Wilf H.S. Generating Functionology 2nd Edition 1990 Academic Press San Diego, CA