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: | Lau, G.C (Author), Peng, Y.H (Author) |
---|---|
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
Similar Items
ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
by: Pavel A. Gein
Published: (2021-07-01)
by: Pavel A. Gein
Published: (2021-07-01)
Similar Items
-
ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
by: Pavel A. Gein
Published: (2021-07-01) -
Chromaticity of complete 4-partite graphs with certain star or matching deleted
by: Lau, G.C, et al. -
Chromaticity of a family of 5-partite graphs
by: Hasni, R., et al.
Published: (2014) -
On the chromaticity of complete multipartite graphs with certain edges added
by: Lau, G.C, et al. -
Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
by: N.S.A. Karim, et al.
Published: (2016-04-01)