数学物理学报(英文版) ›› 2004, Vol. 24 ›› Issue (4): 577-582.

• 论文 • 上一篇    下一篇

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

许进   

  1. Department of Control Science and Engineering,
    Huazhong University of Science and Technology, Wuhan 430074, China
  • 出版日期:2004-10-20 发布日期:2004-10-20
  • 基金资助:

    This research is partially supported by NNSF of China.

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.

摘要:

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.

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

中图分类号: 

  • 05C