[PDF][PDF] On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles
… 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. …
to be chromatically unique are already known in the literature (see [3], [13], [15] or [10]), not
a great deal is known about the chromatic uniqueness of …
complete tripartite graph at an edge is uniquely determined by its chromatic polynomial. …
to be chromatically unique are already known in the literature (see [3], [13], [15] or [10]), not
a great deal is known about the chromatic uniqueness of …
Abstract
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.
Citeseer
以上显示的是最相近的搜索结果。 查看全部搜索结果