Approximations for chromatic polynomials

DOI10.1016/0095-8956(76)90062-9zbMath0283.05102MaRDI QIDQ1844241

Norman L. Biggs, G. H. J. Meredith

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

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

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, Exact chromatic polynomials for toroidal chains of complete graphs, The limit of chromatic polynomials, Forests, colorings and acyclic orientations of the square lattice, A bibliography on chromatic polynomials, Exact Potts model partition function on strips of the triangular lattice, Ground state entropy of the Potts antiferromagnet on strips of the square lattice, On graph invariants given by linear recurrence relations, \(T=0\) partition functions for Potts antiferromagnets on lattice strips with fully periodic boundary conditions, A matrix method for 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

Cites Work

• Unnamed Item
• 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