摘要
依据理想子图的概念,得到了其补图为完全偶图及空图之并的图的色多项式,并讨论了这种图的色唯一性.
We have obtained the chromatic polynomial of a graph G whose complement is the union of a complete bipartite graph and an empty graph by the ideal subgraph, and discussed the chromatic uniqueness of G.
关键词
理想子图
色多项式
色唯一性
补图
完全偶图
Ideal subgraphs, Chromatic polynomials, Chromatic uniqueness, Adjointly unique