A result on chromatic uniqueness of edge-gluing of graphs

In this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial.

Saved in:
书目详细资料
Main Authors: Chia G.L., Ho C.-K.
其他作者: 55914572800
格式: Article
出版: 2023
主题:
标签: 添加标签
没有标签, 成为第一个标记此记录!

相似书籍