Chromatic equivalence classes of some families of complete tripartite graphs
We obtain new necessary conditions on a graph which shares the same chromatic polynomial as that of the complete tripartite graph Km,n,r. Using these, we establish the chromatic equivalence classes for K1,n,n+1 (where n ≥ 2). This gives a partial solution to a question raised earlier by the authors....
Saved in:
Main Authors: | Chia, G. L., Ho, Chee-Kit * |
---|---|
Format: | Article |
Language: | English |
Published: |
Malaysian Mathematical Sciences Society
2014
|
Subjects: | |
Online Access: | http://eprints.sunway.edu.my/273/1/Chromatic%20equivalence_HoCK%20%282%29.pdf http://eprints.sunway.edu.my/273/ http://www.emis.de/journals/BMMSS/pdf/v37n3/v37n3p3.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Chromatic equivalence class of the join of certain tripartite graphs
by: Lau, Gee Choon, et al.
Published: (2007) -
Chromatic Equivalence Classes and Chromatic Defining Numbers of Certain Graphs
by: Omoomi, Behnaz
Published: (2001) -
On chromatic polynomials of graphs / Ho, Chee Kit.
by: Ho, Chee Kit
Published: (1998) -
Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
by: Lau, G.C., et al.
Published: (2004) -
Equivalence of dual graphs
by: Azram, Mohammad
Published: (2013)