Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126304296, #quickstatements; #temporary_batch_1721947978549 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126304296 / rank | |||
Normal rank | |||
Latest revision as of 00:02, 26 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
11 May 2020
0 references
chromatic completion
0 references
perfect lucky 3-coloring
0 references
lucky 3-polynomial
0 references
