Complexity issues on bounded restrictive \(H\)-coloring (Q2370448)
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 5167120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity issues on bounded restrictive \(H\)-coloring |
scientific article; zbMATH DE number 5167120 |
Statements
Complexity issues on bounded restrictive \(H\)-coloring (English)
0 references
26 June 2007
0 references
restrictive \(H\)-coloring
0 references
restrictive list \(H\)-coloring
0 references
parameterization
0 references
counting problems
0 references
NP-complete
0 references
{\#}P-complete
0 references
0.8776793479919434
0 references
0.8452337980270386
0 references
0.8279796242713928
0 references
0.8198839426040649
0 references
