Library Header Image
LSE Research Online LSE Library Services

The interlace polynomial: a new graph polynomial

Arratia, Richard, Bollobás, Béla and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2000) The interlace polynomial: a new graph polynomial. In: Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000-01-09 - 2000-01-11, San Francisco, United States, USA.

Full text not available from this repository.


We define a new graph polynomial, the interlace polynomial, for any undirected graph. Also, we show how to count Euler circuits and circuitdecompositions for any directed or undirected Eulerian graph, by a straightforward reduction formula. For 2-in, 2-out directed graphs D, any Euler circuit induces an undirected "interlace" graph H, and there is a close relationship between the number of circuit decompositions of D and the interlace polynomial of H. We explore this relationship, and properties of the interlace polynomial in general.

Item Type: Conference or Workshop Item (Paper)
Official URL:
Additional Information: © The Authors
Divisions: Management
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 13 May 2011 13:01
Last Modified: 16 May 2024 10:56

Actions (login required)

View Item View Item