Expansions of the chromatic polynomial

DOI10.1016/0012-365X(73)90040-XzbMATH Open0271.05110MaRDI QIDQ759159FDOQ759159

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)

Cites Work

• On dichromatic 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
• An introduction to chromatic polynomials
• Linked-cluster expansion of the graph-vertex coloration problem
• A new subgraph expansion for obtaining coloring polynomials for graphs

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759159)