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:
Bibliographic Details
Main Authors: Chia G.L., Ho C.-K.
Other Authors: 55914572800
Format: Article
Published: 2023
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items