Using thresholds to compute chromatic polynomials.

MaRDI QIDQ2716001zbMATH OpenFDO

Authors Gary Haggard, Thomas R. Mathies

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

hash table

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The computation of chromatic polynomials
• Note on chromatic polynomials of the threshold graphs
• scientific article; zbMATH DE number 4181365
• scientific article; zbMATH DE number 2199828
• scientific article; zbMATH DE number 4087683
• scientific article; zbMATH DE number 205347
• Algebraic methods for chromatic polynomials.
• scientific article; zbMATH DE number 3904612
• scientific article; zbMATH DE number 4128831
• Approximating the chromatic polynomial

Cited in

(5)

• scientific article; zbMATH DE number 4095494 (Why is no real title available?)
• scientific article; zbMATH DE number 637289 (Why is no real title available?)
• scientific article; zbMATH DE number 205347 (Why is no real title available?)
• scientific article; zbMATH DE number 851920 (Why is no real title available?)
• On the absolute sum of chromatic polynomial coefficient of graphs

This page was built for publication: Using thresholds to compute chromatic polynomials.

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