Publisher
Springer International Publishing
Reference16 articles.
1. Agnarsson, G.: On chordal graphs and their chromatic polynomials. Math. Scand. 93, 240–246 (2003)
2. Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1–29. Springer, New York (1993). https://doi.org/10.1007/978-1-4613-8369-7_1
3. Borwein, P.B.: On the complexity of calculating factorials. J. Algorithms 6(3), 376–380 (1985)
4. Brylawski, T., Oxley, J.: The tutte polynomial and its applications. Matroid Appl. 40, 123–225 (1992)
5. Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248–257 (1997)