The interlace polynomial of graphs at -1

European Journal of Combinatorics

Volumn 23, Issue 7, 2002, Pages 761-767

  Balister, P N ^b   Bollobas B ^a,b   Cutler, J ^b   Pebody, L ^b  

^a TRINITY COLLEGE   (United Kingdom)

^b University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10644246806     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2002.0602     Document Type: Article

References (10)

1. R. Arratia, B. Bollobás, D. Coppersmith and G. Sorkin, Euler circuits and DNA sequencing by hybridization, Discrete Appl. Math., 104 (2000), 63-96.
2. R. Arratia, B. Bollobás and G. Sorkin, The interlace polynomial: a new graph polynomial, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York (2000), pp. 237-245.
3. R. Arratia, B. Bollobás and G. Sorkin, The interlace polynomial: a new graph polynomial, manuscript.
4. M. Las Vergnas, Eulerian circuits of 4-valent graphs imbedded in surfaces, in: Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978), Coll. Math. Soc. J. Bolyai 25, North-Holland, Amsterdam, 1981, pp. 451-477.
5. M. Las Vergnas, Eulerian circuits of 4-valent graphs imbedded in surfaces, in: Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978), Coll. Math. Soc. J. Bolyai 25, North-Holland, Amsterdam, 1981, pp. 451-477.
6. M. Las Vergnas, Le polynöme de Martin d'un graphe Eulérian, in: Combinatorial Mathematics (Marseille-Luminy, 1981), North-Holland. Math. Stud. 75, North-Holland, Amsterdam, 1983, pp. 397-411.
7. M. Las Vergnas, Le polynöme de Martin d'un graphe Eulérian, in: Combinatorial Mathematics (Marseille-Luminy, 1981), North-Holland. Math. Stud. 75, North-Holland, Amsterdam, 1983, pp. 397-411.
8. P. Martin, Remarkable valuation of the dichromatic polynomial of planar multigraphs, J. Comb. Theory, Ser. B, 24 (1978), 318-324.
9. P. Rosenstiehl and R. C. Read, On the principal edge tripartition of a graph, in: Advances in Graph Theory, Cambridge Combinatorial Conference, B. Bollobás (ed.), Trinity College, Cambridge, 1977 Ann. Discrete Math., 3 (1978), 195-226.
10. P. Rosenstiehl and R. C. Read, On the principal edge tripartition of a graph, in: Advances in Graph Theory, Cambridge Combinatorial Conference, B. Bollobás (ed.), Trinity College, Cambridge, 1977 Ann. Discrete Math., 3 (1978), 195-226.