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

From MaRDI portal
Revision as of 15:14, 22 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
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
    chromatic completion
    0 references
    perfect lucky 3-coloring
    0 references
    lucky 3-polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references