On the Chromatic Uniqueness of Edge-Gluing
of Complete Tripartite Graphs and Cycles
Bulletin of the Malaysian Mathematical Society, Tome 26 (2003) no. 1
In this paper, it is shown that the graph obtained by overlapping the cycle and the complete tripartite graph at an edge is uniquely determined by its chromatic polynomial.
@article{BMMS_2003_26_1_a10,
author = {Gek Ling Chia and Chee-Kit Ho},
title = {On the {Chromatic} {Uniqueness} of {Edge-Gluing
} of {Complete} {Tripartite} {Graphs} and {Cycles}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2003},
volume = {26},
number = {1},
url = {http://geodesic.mathdoc.fr/item/BMMS_2003_26_1_a10/}
}
Gek Ling Chia; Chee-Kit Ho. On the Chromatic Uniqueness of Edge-Gluing
of Complete Tripartite Graphs and Cycles. Bulletin of the Malaysian Mathematical Society, Tome 26 (2003) no. 1. http://geodesic.mathdoc.fr/item/BMMS_2003_26_1_a10/