Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647212 | Discrete Mathematics | 2015 | 14 Pages |
Abstract
The chromatic equivalence class of a graph G is the set of graphs that have the same chromatic polynomial as G. We find the chromatic equivalence class of the complete tripartite graphs K1,n,n+2 for all nâ¥2. This partially answers a question raised in Chia and Ho (2009), which asks for the chromatic equivalence class of the graph K1,m,n where 2â¤mâ¤n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Boon Leong Ng, Fengming Dong,