论文信息 - The Interlace Polynomial of Graphs at - 1

The Interlace Polynomial of Graphs at - 1

In this paper we give an explicit formula for the interlace polynomial atx=?1 for any graph, and as a result prove a conjecture of Arratia et al. that states that it is always of the form ± 2s. We also give a description of the graphs for which s is maximal.

[1] P. Rosenstiehl,et al. On the Principal Edge Tripartition of a Graph , 1978 .

[2] Béla Bollobás,et al. The interlace polynomial: a new graph polynomial , 2000, SODA '00.

[3] M. L. Vergnas,et al. Le Polynôme De Martin D'un Graphe Eulerien , 1983 .

[4] Pierre Martin,et al. Remarkable valuation of the dichromatic polynomial of planar multigraphs , 1978, J. Comb. Theory, Ser. B.

[5] Béla Bollobás,et al. Euler circuits and DNA sequencing by hybridization , 2000, Discret. Appl. Math..