On the chromaticity of complete multipartite graphs with certain edges added
Let P (G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P (H, λ) = P (G, λ) implies H is isomorphic to G. For integers k ≥ 0, t ≥ 2, denote by K ((t - 1) × p, p + k) the complete t-partite graph that has t - 1 partite sets of size p and one partit...
| Published in: | Discrete Mathematics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
2009
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-67349096082&doi=10.1016%2fj.disc.2008.12.008&partnerID=40&md5=7a46f9900f08845ace27be6128d38575 |