Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6782824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dichotomies properties on computational complexity of \(S\)-packing coloring problems |
scientific article; zbMATH DE number 6782824 |
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
0.8237263560295105
0 references
0.8231670260429382
0 references
0.817806601524353
0 references
0.8088046908378601
0 references
0.7982341647148132
0 references
