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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |