A matrix method for chromatic polynomials

DOI10.1006/jctb.2000.2017zbMath1026.05045OpenAlexW2108292441MaRDI QIDQ1850530

Norman L. Biggs

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/89ef5046d1b1128867ab538dbfcf05ad6ca40b87

zbMATH Keywords

eigenspaceslinear operatorcompatibility matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items

A dense set of chromatic roots which is closed under multiplication by positive integers, Algebraic methods for chromatic polynomials., Tutte polynomials and related asymptotic limiting functions for recursive families of graphs, Exact chromatic polynomials for toroidal chains of complete graphs, A little statistical mechanics for the graph theorist, General structural results for Potts model partition functions on lattice strips, Chromatic polynomials and representations of the symmetric group

Cites Work

• Unnamed Item
• Unnamed Item
• Limits of chromatic zeros of some families of maps
• On the roots of chromatic polynomials
• The computation of chromatic polynomials
• Approximations for chromatic polynomials
• Recursive families of graphs
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Colouring Square Lattice Graphs
• Ground-state entropy of the Potts antiferromagnet on cyclic strip graphs
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• T= 0 partition functions for Potts antiferromagnets on square lattice strips with (twisted) periodic boundary conditions
• A new 5‐arc‐transitive cubic graph