The limit of chromatic polynomials
From MaRDI portal
Publication:754885
Cites work
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3076589 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A new subgraph expansion for obtaining coloring polynomials for graphs
- Approximations for chromatic polynomials
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Directed compact percolation: cluster size and hyperscaling
- Lattice Constant Systems and Graph Theory
- Linked-cluster expansion of the graph-vertex coloration problem
Cited in
(8)- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions
- A little statistical mechanics for the graph theorist
- A bibliography on chromatic polynomials
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- Synergistic development of differential approximants and the finite lattice method in lattice statistics
- The Potts model and the Tutte polynomial.
- Polynomial sequences of binomial-type arising in graph theory
- Forests, colorings and acyclic orientations of the square lattice
This page was built for publication: The limit of chromatic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754885)