Skip to main content Accessibility help
×
×
Home
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 43
  • Cited by
    This chapter has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Makowsky, J. A. 2006. Logical Approaches to Computational Barriers. Vol. 3988, Issue. , p. 330.

    Tanguy, Christian 2007. Exact two-terminal reliability of some directed networks. p. 1.

    Jacobsen, Jesper Lykke 2007. Tetromino tilings and the Tutte polynomial. Journal of Physics A: Mathematical and Theoretical, Vol. 40, Issue. 7, p. 1439.

    Tanguy, Christian 2007. What is the probability of connecting two points?. Journal of Physics A: Mathematical and Theoretical, Vol. 40, Issue. 47, p. 14099.

    Caracciolo, Sergio Sokal, Alan D and Sportiello, Andrea 2007. Grassmann integral representation for spanning hyperforests. Journal of Physics A: Mathematical and Theoretical, Vol. 40, Issue. 46, p. 13799.

    Averbouch, Ilia Godlin, Benny and Makowsky, Johann A. 2008. Graph-Theoretic Concepts in Computer Science. Vol. 5344, Issue. , p. 31.

    DONG, F. M. and KOH, K. M. 2008. Bounds For The Real Zeros of Chromatic Polynomials. Combinatorics, Probability and Computing, Vol. 17, Issue. 06, p. 749.

    Jacobsen, Jesper Lykke and Saleur, Hubert 2008. Boundary Chromatic Polynomial. Journal of Statistical Physics, Vol. 132, Issue. 4, p. 707.

    Cameron, Peter J. Jackson, Bill and Rudd, Jason D. 2008. Orbit-counting polynomials for graphs and codes. Discrete Mathematics, Vol. 308, Issue. 5-6, p. 920.

    Bedini, Andrea Caracciolo, Sergio and Sportiello, Andrea 2008. Hyperforests on the complete hypergraph by Grassmann integral representation. Journal of Physics A: Mathematical and Theoretical, Vol. 41, Issue. 20, p. 205003.

    SEMPLE, CHARLES and WELSH, DOMINIC 2008. Negative Correlation in Graphs and Matroids. Combinatorics, Probability and Computing, Vol. 17, Issue. 03,

    Caracciolo, Sergio Paoletti, Guglielmo and Sportiello, Andrea 2008. Explicit characterization of the identity configuration in an Abelian sandpile model. Journal of Physics A: Mathematical and Theoretical, Vol. 41, Issue. 49, p. 495003.

    Borcea, Julius and Brändén, Petter 2009. The Lee-Yang and Pólya-Schur programs. II. Theory of stable polynomials and applications. Communications on Pure and Applied Mathematics, Vol. 62, Issue. 12, p. 1595.

    Caracciolo, Sergio and Sportiello, Andrea 2009. Spanning Forests on Random Planar Lattices. Journal of Statistical Physics, Vol. 135, Issue. 5-6, p. 1063.

    Mohar, Bojan and Salas, Jesús 2009. A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm. Journal of Physics A: Mathematical and Theoretical, Vol. 42, Issue. 22, p. 225204.

    De las Cuevas, Gemma Dür, Wolfgang Van den Nest, Maarten and Briegel, Hans J 2009. Completeness of classical spin models and universal quantum computation. Journal of Statistical Mechanics: Theory and Experiment, Vol. 2009, Issue. 07, p. P07001.

    Teufl, E and Wagner, S 2010. On the number of spanning trees on various lattices. Journal of Physics A: Mathematical and Theoretical, Vol. 43, Issue. 41, p. 415001.

    Biggs, Norman 2010. Tutte polynomials of bracelets. Journal of Algebraic Combinatorics, Vol. 32, Issue. 3, p. 389.

    Teufl, Elmar and Wagner, Stephan 2010. Determinant identities for Laplace matrices. Linear Algebra and its Applications, Vol. 432, Issue. 1, p. 441.

    Park, Woomyoung and Barg, Alexander 2010. Linear ordered codes, shape enumarators and parallel channels. p. 361.

    ×
  • Print publication year: 2005
  • Online publication date: August 2010

8 - The multivariate Tutte polynomial (alias Potts model) for graphs and matroids

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Surveys in Combinatorics 2005
  • Online ISBN: 9780511734885
  • Book DOI: https://doi.org/10.1017/CBO9780511734885
Please enter your name
Please enter a valid email address
Who would you like to send this to *
×