Chromaticity of complete 4-partite graphs with certain star or matching deleted
Let P (G, λ) be a 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 g...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |