Journal of University of Science and Technology of China ›› 2019, Vol. 49 ›› Issue (5): 377-381.DOI: 10.3969/j.issn.0253-2778.2019.05.004
Previous Articles Next Articles
Received:
Revised:
Online:
Published:
Contact:
About author:
Abstract: Let P(G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H, λ)=P(G, λ) implies G≌H.
Key words: complete tripartite graph, chromatically uniqueness, triangular subgraph, quadrangular subgraph without chords
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://just-cn.ustc.edu.cn/EN/10.3969/j.issn.0253-2778.2019.05.004
http://just-cn.ustc.edu.cn/EN/Y2019/V49/I5/377
