Expansions of the chromatic polynomial

DOI10.1016/0012-365X(73)90040-XMaRDI QIDQ759159zbMATH OpenFDO

Authors 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

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

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)