A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs (Q1763351)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs
scientific article

    Statements

    A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    The authors show that \(K(n-k, n-l, n)\) is chromatically unique if \(n\geq 2k\) and \(k\geq 2\). This confirms the Chia, Koh and Teo conjecture.
    0 references
    complete tripartite graph
    0 references
    chromatic polynomial
    0 references
    chromatic uniqueness
    0 references

    Identifiers