The interlace polynomial: a new graph polynomial

@inproceedings{Arratia2000TheIP,
  title={The interlace polynomial: a new graph polynomial},
  author={Richard Arratia and B{\'e}la Bollob{\'a}s and Gregory B. Sorkin},
  booktitle={SODA},
  year={2000}
}
We define a new graph polynomial, the interlace polynomial, for any undirected graph. Also, we show how to count Euler circuits and circuit decompositions 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… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
46 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…