Chinese Quarterly Journal of Mathematics ›› 2010, Vol. 25 ›› Issue (2): 308-311.
Previous Articles Next Articles
Received:
Online:
Published:
About author:
Supported by:
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
CLC Number:
 
O157.5
ZHANG Shu-min. On Chromatically Equivalence of a Class of Graphs[J]. Chinese Quarterly Journal of Mathematics, 2010, 25(2): 308-311.
/ Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: https://sxjk.magtechjournal.com/EN/
https://sxjk.magtechjournal.com/EN/Y2010/V25/I2/308