A two-variable interlace polynomial

Combinatorica

Volumn 24, Issue 4, 2004, Pages 567-584

  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

[No Author keywords available]

Indexed keywords

EID: 16244381723     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-004-0035-6     Document Type: Article

References (19)

1. RICHARD ARRATIA, BÉLA BOLLOBÁS and GREGORY B. SORKIN: The interlace polynomial of a graph, J. Combin. Theory Ser. B, to appear.
2. RICHARD ARRATIA, BÉLA BOLLOBÁS and GREGORY B. SORKIN: The interlace polynomial: A new graph polynomial, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000), (New York), ACM, January 2000, pp. 237-245.
3. MARTIN AIGNER and HEIN VAN DER HOLST: Interlace polynomials, Linear Algebra Appl. 377 (2004), 11-30.
4. P. N. BALISTER, B. BOLLOBÁS, J. CUTLER and L. PEBODY: The interlace polynomial of graphs at - 1, European J. Combin. 23(7) (2002), 761-767.
5. BÉLA BOLLOBÁS: Evaluations of the circuit partition polynomial, J. Combin. Theory Ser. B 85(2) (2002), 261-268.
6. ANDRÉ BOUCHET: Isotropic systems, European J. Combin. 8(3) (1987), 231-244.
7. ANDRÉ BOUCHET: Graphic presentations of isotropic systems, J. Combin. Theory Ser. B 45(1) (1988), 58-76.
8. ANDRÉ BOUCHET: Tutte-Martin polynomials and orienting vectors of isotropic systems, Graphs Combin. 7(3) (1991), 235-252.
9. ANDRÉ BOUCHET: Multimatroids III. Tightness and fundamental graphs, Tech. Report, Département d'Informatique, Université du Maine, Le Mans, France, September 1999.
10. ANDRÉ BOUCHET: personal communication, September 2000.
11. MARTIN DYER, ALAN FRIEZE and MARK JERRUM: On counting independent sets in sparse graphs, Tech. Report ECS-LFCS-98-391, Univ. of Edinburgh, Edinburgh, Scotland, 1998.
12. MARTIN DYER and CATHERINE GREENHILL: On Markov chains for independent sets, Journal of Algorithms 35(1) (2000), 17-49.
13. JOANNA A. ELLIS-MONAGHAN: New results for the Martin polynomial, J. Combin. Theory Ser. B 74(2) (1998), 326-352.
14. JOANNA A. ELLIS-MONAGHAN: Identities for the circuit partition polynomials, with applications to the diagonal Tutte polynomial, unpublished manuscript, 2000.
15. F. JAEGER, D. L. VERTIGAN and D. J. A. WELSH: On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc. 108 (1990), 35-53.
16. A. KOTZIG: Eulerian lines in finite 4-valent graphs and their transformations, Theory of Graphs: Proceedings of the colloquium held at Tihany, Hungary, September 1966 (P. Erdös and G. Katona, eds.), Academic Press, 1969, pp. 219-230.
17. PIERRE MARTIN: Remarkable valuation of the dichromatic polynomial of planar multigraphs, J. Combin. Theory Ser. B 24(3) (1978), 318-324.
18. WERNER SCHWÄRZLER: The coefficients of the Tutte polynomial are not unimodal, J. Combin. Theory Ser. B 58(2) (1993), 240-242.
19. D. J. A. WELSH: Complexity: Knots, colourings, and counting, London Mathematical Society Lecture Notes Series, no. 186, Cambridge University Press, Cambridge, England, 1993.