Graph Description by the Chromatic Polynomials

Chinese Quarterly Journal of Mathematics ›› 2009, Vol. 24 ›› Issue (1): 46-52.

Previous Articles Next Articles

Graph Description by the Chromatic Polynomials

1. Department of Mathematics, Qinghai Nationalities University2. Department of Mathematics, Qinghai Normal University

Received:2005-04-21 Online:2009-03-30 Published:2023-09-06
About author:MA Hai-cheng(1965- ), male, native of Menyuan, Qinghai, a professor of Qinghai Nationalities University, engages in algebraic graph theory.
Supported by:
Supported by the NNSF of China(10861009)； Supported by the Ministry of Education Science and Technology Item of China(206156)；

Abstract

CLC Number:

O157.5

MA Hai-cheng, LIU Hui-min, ZHANG Hai-liang. Graph Description by the Chromatic Polynomials [J]. Chinese Quarterly Journal of Mathematics, 2009, 24(1): 46-52.

[1]	ZHANG Shu-min. On Chromatically Equivalence of a Class of Graphs [J]. Chinese Quarterly Journal of Mathematics, 2010, 25(2): 308-311.
[2]	ZHANG Bing-ru, YANG Ji-ming. The Factorization of Adjoint Polynomials of E^G(i)-class Graphs and Chromatically Equivalence Analysis [J]. Chinese Quarterly Journal of Mathematics, 2008, 23(3): 376-383.

Graph Description by the Chromatic Polynomials

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 2

Recommended Articles

Metrics

Comments