The limit of chromatic polynomials
From MaRDI portal
Publication:754885
DOI10.1016/0095-8956(79)90008-XzbMATH Open0417.05028OpenAlexW2013224399MaRDI QIDQ754885FDOQ754885
Authors: D. Kim, Ian G. Enting
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90008-x
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Linked-cluster expansion of the graph-vertex coloration problem
- A new subgraph expansion for obtaining coloring polynomials for graphs
- Directed compact percolation: cluster size and hyperscaling
- Approximations for chromatic polynomials
- Lattice Constant Systems and Graph Theory
Cited In (8)
- A bibliography on chromatic polynomials
- A little statistical mechanics for the graph theorist
- Polynomial sequences of binomial-type arising in graph theory
- Synergistic development of differential approximants and the finite lattice method in lattice statistics
- Forests, colorings and acyclic orientations of the square lattice
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions
- The Potts model and the Tutte polynomial.
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
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)