Chromaticity of complete 4-partite graphs with certain star or matching deleted
2010 ◽
Vol 4
(2)
◽
pp. 253-268
◽
Let P(G,?) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ~ H, if P(G,?) = P(H,?). We write [G] = {H |H ~ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 4-partite graphs G accordingly to the number of 5-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, we obtain new families of chromatically unique complete 4-partite graphs with certain star or matching deleted.
2010 ◽
Vol 14
(2)
◽
pp. 507-540
◽
1981 ◽
Vol 4
(2)
◽
pp. 365-369
◽
1982 ◽
Vol 34
(3)
◽
pp. 741-758
◽
2010 ◽
Vol 31
(1)
◽
pp. 1-17
◽
Keyword(s):
Keyword(s):
2008 ◽
Vol 308
(16)
◽
pp. 3551-3564
◽
Keyword(s):