Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Arratia, R., Bollobás, B., Sorkin, G.B.: The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B 92, 199–233 (2004)
2. Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Applied Mathematics 108(1-2), 23–52 (2001)
3. Courcelle, B., Olariu, S.: Upper bounds to the clique–width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)
4. Courcelle, B.: A multivariate interlace polynomial (preprint) (December 2006)
5. Graduate Texts in Mathematics;R. Diestel,1996