Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2478/ausi-2019-0014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3002022057 / rank | |||
Normal rank | |||
Revision as of 21:38, 19 March 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
