Approximations for chromatic polynomials
From MaRDI portal
Publication:1844241
DOI10.1016/0095-8956(76)90062-9zbMath0283.05102OpenAlexW1997742365MaRDI QIDQ1844241
G. H. J. Meredith, Norman L. Biggs
Publication date: 1976
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(76)90062-9
Related Items
A bibliography on chromatic polynomials, \(T=0\) partition functions for Potts antiferromagnets on Möbius strips and effects of graph topology, The Potts model and the Tutte polynomial, Exact chromatic polynomials for toroidal chains of complete graphs, Chromatic polynomials for lattice strips with cyclic boundary conditions, Structural properties of Potts model partition functions and chromatic polynomials for lattice strips, Exact Potts model partition functions on strips of the honeycomb lattice, Exact Potts model partition functions on wider arbitrary-length strips of the square lattice, Ground state entropy of the Potts antiferromagnet on triangular lattice strips., Potts model partition functions for self-dual families of strip graphs, On graph invariants given by linear recurrence relations, The limit of chromatic polynomials, Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs, Exact Potts model partition function on strips of the triangular lattice, \(T=0\) partition functions for Potts antiferromagnets on lattice strips with fully periodic boundary conditions, A matrix method for chromatic polynomials, Forests, colorings and acyclic orientations of the square lattice, Ground state entropy of the Potts antiferromagnet on strips of the square lattice
Cites Work
- Linked-cluster expansion of the graph-vertex coloration problem
- Recursive families of graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- A new 5‐arc‐transitive cubic graph
- Unnamed Item
