一类图的色等价性

收稿日期:2007-04-11 出版日期:2010-06-30 发布日期:2023-06-06
作者简介:ZHANG Shu-min(1971-), female, native of Peixian, Jiangsu, an associate professor of Qinghai Normal University, M.S.D., engages in graphs theory.
基金资助:
Supported by the National Science Foundation of China(10640009)；

Received:2007-04-11 Online:2010-06-30 Published:2023-06-06
About author:ZHANG Shu-min(1971-), female, native of Peixian, Jiangsu, an associate professor of Qinghai Normal University, M.S.D., engages in graphs theory.
Supported by:
Supported by the National Science Foundation of China(10640009)；

摘要： A class of new graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven.

关键词: chromatic polynomial, chromatically equivalent graphs, ladder graphs

Abstract: A class of new graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven.

Key words: chromatic polynomial, chromatically equivalent graphs, ladder graphs

中图分类号:

张淑敏. 一类图的色等价性[J]. 数学季刊, 2010, 25(2): 308-311.

ZHANG Shu-min. On Chromatically Equivalence of a Class of Graphs[J]. Chinese Quarterly Journal of Mathematics, 2010, 25(2): 308-311.

[1]	马海成, 刘慧敏, 张海良. 色多项式对图的刻画[J]. 数学季刊, 2009, 24(1): 46-52.
[2]	张秉儒, 杨继明. E^G(i)类图簇的伴随多项式[J]. 数学季刊, 2008, 23(3): 376-383.

PDF (PC)