Recursively constructible families of graphs
暂无分享,去创建一个
[1] Marc Noy,et al. Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice , 2003, Electron. J. Comb..
[2] Marc Noy,et al. Irreducibility of the Tutte Polynomial of a Connected Matroid , 2001, J. Comb. Theory, Ser. B.
[3] Robert Shrock. Chromatic polynomials and their zeros and asymptotic limits for families of graphs , 2001, Discret. Math..
[4] Tom Brylawski,et al. Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .
[5] R. M. Damerell,et al. Recursive families of graphs , 1972 .
[6] Yuanping Zhang,et al. The number of spanning trees in circulant graphs , 2000, Discret. Math..
[7] D. Welsh. Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .