On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593)

From MaRDI portal
Revision as of 09:01, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the greatest number of 2 and 3 colorings of a (v, e)-graph
scientific article

    Statements

    On the greatest number of 2 and 3 colorings of a (v, e)-graph (English)
    0 references
    0 references
    1989
    0 references
    chromatic polynomial
    0 references
    proper lambda colouring
    0 references

    Identifiers