Expansions of the chromatic polynomial

DOI10.1016/0012-365X(73)90040-XzbMath0271.05110MaRDI QIDQ759159

Norman L. Biggs

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A broken-circuits-theorem for hypergraphs ⋮ A bibliography on chromatic polynomials

Cites Work

• Linked-cluster expansion of the graph-vertex coloration problem
• A new subgraph expansion for obtaining coloring polynomials for graphs
• On dichromatic polynomials
• An introduction to chromatic polynomials
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem

This page was built for publication: Expansions of the chromatic polynomial