Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544)

From MaRDI portal
Revision as of 22:32, 25 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximizing the number of \(x\)-colorings of 4-chromatic graphs
scientific article

    Statements

    Maximizing the number of \(x\)-colorings of 4-chromatic graphs (English)
    0 references
    0 references
    5 April 2018
    0 references
    0 references
    \(x\)-coloring
    0 references
    chromatic number
    0 references
    \(k\)-chromatic
    0 references
    chromatic polynomial
    0 references
    \(k\)-connected graph
    0 references
    subdivision
    0 references
    theta graph
    0 references