Chinese Quarterly Journal of Mathematics ›› 2010, Vol. 25 ›› Issue (2): 308-311.

Previous Articles     Next Articles

On Chromatically Equivalence of a Class of Graphs

  

  1. Department of Mathematics, Qinghai Normal University

  • 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);

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: