Chromatic equivalence classes of complete tripartite graphs

Some necessary conditions on a graph which has the same chromatic polynomial as the complete tripartite graph Km, n, r are developed. Using these, we obtain the chromatic equivalence classes for Km, n, n (where 1 ? m ? n) and Km1, m2, m3 (where | mi - mj | ? 3). In particular, it is shown that (i) K...

Full description

Saved in:
Bibliographic Details
Main Authors: Chia G.L., Ho C.-K.
Other Authors: 55914572800
Format: Article
Published: 2023
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first