Galois groups of chromatic polynomials
From MaRDI portal
Publication:5169640
DOI10.1112/S1461157012001052zbMath1291.05070MaRDI QIDQ5169640
Publication date: 11 July 2014
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Non-bipartite chromatic factors
- Pairs of chromatically equivalent graphs
- A little statistical mechanics for the graph theorist
- Limits of chromatic zeros of some families of maps
- Chromatic roots - some observations and conjectures
- The Magma algebra system. I: The user language
- Zeros of chromatic and flow polynomials of graphs
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial
- The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
- \(T=0\) partition functions for Potts antiferromagnets on Möbius strips and effects of graph topology
- Recursive families of graphs
- On Transitive Permutation Groups
- Ground-state entropy of the Potts antiferromagnet on cyclic strip graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- T= 0 partition functions for Potts antiferromagnets on square lattice strips with (twisted) periodic boundary conditions
- An introduction to chromatic polynomials
- Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. II: Extended results for square-lattice chromatic polynomial.
- Ground state entropy in Potts antiferromagnets and chromatic polynomials