Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1312.5280 / rank | |||
Normal rank | |||
Revision as of 05:35, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dichotomies properties on computational complexity of \(S\)-packing coloring problems |
scientific article |
Statements
Dichotomies properties on computational complexity of \(S\)-packing coloring problems (English)
0 references
28 September 2017
0 references
NP-complete problem
0 references
graph
0 references
packing chromatic number
0 references
\(S\)-packing chromatic number
0 references
\(d\)-distance coloring
0 references
