Chromaticity of certain tripartite graphs identified with a path
For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically equivalent if P (G) = P (H). A graph G is chromatically unique if P (H) = P (G) implies that H ≅ G. In this paper, we classify the chromatic classes of graphs obtained from K2, 2, 2 ∪ Pm (m ≥ 3), (K2, 2, 2 - e...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |