id: 05809798
dt: j
an: 05809798
au: Roslan, H.; Ameen, A.Sh.; Peng, Y.H.; Zhao, H.X.
ti: Classification of complete 5-partite graphs and chromaticity of 5-partite
    graphs with $5n + 2$ vertices.
so: Far East J. Math. Sci. (FJMS) 43, No. 1, 59-72 (2010).
py: 2010
pu: Pushpa Publishing House, Allahabad, Uttar Pradesh, India
la: EN
cc: 
ut: chromatic polynomial; chromatically closed; chromatic uniqueness
ci: 
li: http://pphmj.com/abstract/5149.htm
ab: Summary: Let $P(G, λ)$ be the chromatic polynomial of a graph $G$. Then
    two graphs $G$ and $H$ are said to be chromatically equivalent, denoted
    as $G \sim H$ if $P(G, λ)$ We write $|G| = \{H| \sim G\}$ If $[G] =
    \{G\}$ then $G$ is said to be chromatically unique. In this paper, we
    first characterize certain complete 5-partite graphs with $5n + 2$
    vertices according to the number of 6-independent partitions of $G$.
    Using these results, we investigate the chromaticity of $G$ with
    certain star or matching deleted. As a by-product, many new families of
    chromatically unique complete 5-partite graphs with certain star or
    matching deleted are obtained.
rv: