On the chromaticity of complete multipartite graphs with certain edges added
Let P (G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P (H, λ) = P (G, λ) implies H is isomorphic to G. For integers k ≥ 0, t ≥ 2, denote by K ((t - 1) × p, p + k) the complete t-partite graph that has t - 1 partite sets of size p and one partit...
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) -
Chromaticity of certain tripartite graphs identified with a path
by: Lau, G.C, et al. -
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
by: Le Xuan Hung
Published: (2019-07-01) -
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle
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)