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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5855820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow degree-jump coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to the <i>k</i>-defect polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Revision as of 16:14, 22 July 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
    0 references