Arratia, Richard , Bollobás, Béla and Sorkin, Gregory B. (2000) The interlace polynomial: a new graph polynomial. In: Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms , 9-11 January 2000, San Francisco, California .
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)|
|Additional Information:||© The Authors|
|Library of Congress subject classification:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Sets:||Research centres and groups > Management Science Group
Departments > Management
Actions (login required)
|Record administration - authorised staff only|