It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynomials that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recognizable from their vertex-deleted subgraphs.
机构:
Hebei Normal Univ Sci & Technol, Sch Math & Informat Technol, Qinhuangdao 066004, Hebei, Peoples R ChinaHebei Normal Univ Sci & Technol, Sch Math & Informat Technol, Qinhuangdao 066004, Hebei, Peoples R China
Wang, Ying
Wang, Yiqiao
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Univ Chinese Med, Sch Management, Beijing 100029, Peoples R ChinaHebei Normal Univ Sci & Technol, Sch Math & Informat Technol, Qinhuangdao 066004, Hebei, Peoples R China
Wang, Yiqiao
论文数: 引用数:
h-index:
机构:
Wang, Weifan
Cui, Shuyu
论文数: 0引用数: 0
h-index: 0
机构:
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R ChinaHebei Normal Univ Sci & Technol, Sch Math & Informat Technol, Qinhuangdao 066004, Hebei, Peoples R China
机构:
Univ Paris 09, PSL, LAMSADE UMR7243, Paris, FranceUniv Paris 09, PSL, LAMSADE UMR7243, Paris, France
Gastineau, Nicolas
Holub, Premysl
论文数: 0引用数: 0
h-index: 0
机构:
Univ West Bohemia, Dept Math, European Ctr Excellence NTIS New Technol Informat, POB 314, Plzen 30614, Czech RepublicUniv Paris 09, PSL, LAMSADE UMR7243, Paris, France
Holub, Premysl
Togni, Olivier
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bourgogne Franche Comte, Le2I FRE2005, F-21000 Dijon, FranceUniv Paris 09, PSL, LAMSADE UMR7243, Paris, France