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...
| Published in: | Discrete Mathematics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
2006
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-33749251616&doi=10.1016%2fj.disc.2006.05.029&partnerID=40&md5=a0d884d6937462a98ad5170f59d1bdfb |