Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs (Q461058)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
scientific article

    Statements

    Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs (English)
    0 references
    0 references
    0 references
    9 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    integer partition
    0 references
    lattice
    0 references
    complete multipartite graph
    0 references
    chromatic polynomial
    0 references
    chromatic uniqueness
    0 references