Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:00, 2 February 2024

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