A Result on Chromatic Uniqueness of Edge-Gluing of Graphs

Abstract

In this paper, it is shown that the graph obtained by overlapping the cycle $C_m$ ($m\ge 3$) and the complete bipartite graph $K_{3,3}$ at an edge is uniquely determined by its chromatic polynomial.