数学物理学报(英文版) ›› 2004, Vol. 24 ›› Issue (4): 577-582.
许进
HU Jin
摘要:
new recursive vertex-deleting formula for the computation of the chromatic
polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for
further studying chromatic polynomials but also the fastest among all the algorithms for
the computation of chromatic polynomials.
中图分类号: