Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038): Difference between revisions
From MaRDI portal
Latest revision as of 11:11, 14 July 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