Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745)

From MaRDI portal
Revision as of 01:02, 26 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126304296, #quickstatements; #temporary_batch_1721947978549)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs
scientific article

    Statements

    Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (English)
    0 references
    0 references
    11 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic completion
    0 references
    perfect lucky 3-coloring
    0 references
    lucky 3-polynomial
    0 references
    0 references
    0 references