Acta mathematica scientia,Series B ›› 2004, Vol. 24 ›› Issue (4): 577-582.

• Articles • Previous Articles     Next Articles

RECURSIVE FORMULA FOR CALCULATING THE
CHROMATIC POLYNOMIAL OF A GRAPH BY
VERTEX DELETION

 HU Jin   

  • Online:2004-10-20 Published:2004-10-20
  • Supported by:

    This research is partially supported by NNSF of China.

Abstract:

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.

Key words: Graph Theory;chromatic polynomial;vertex-deleting recursive formula

CLC Number: 

  • 05C
Trendmd