Complexity of fall coloring for restricted graph classes (Q5918283)
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 7357719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of fall coloring for restricted graph classes |
scientific article; zbMATH DE number 7357719 |
Statements
Complexity of fall coloring for restricted graph classes (English)
0 references
11 June 2021
0 references
graph theory
0 references
computational complexity
0 references
independent domination
0 references
fall coloring
0 references
0.9996251463890076
0 references
0.8447042107582092
0 references
0.7953582406044006
0 references
0.7949945330619812
0 references
0.7937189340591431
0 references
