Publication: A result on chromatic uniqueness of edge-gluing of graphs
No Thumbnail Available
Date
2009
Authors
Chia G.L.
Ho C.-K.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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.
Description
Keywords
Chromatic polynomials , Chromatic uniqueness , Complete bipartite graphs , Graph theory