Complexity of fall coloring for restricted graph classes (Q5919476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of fall coloring for restricted graph classes |
scientific article; zbMATH DE number 7173544
| 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 7173544 |
Statements
Complexity of fall coloring for restricted graph classes (English)
0 references
25 February 2020
0 references
fall coloring
0 references
independent domination
0 references
computational complexity
0 references
0.9996251463890076
0 references
0.8446779847145081
0 references
0.7972608208656311
0 references
0.7971542477607727
0 references
0.7961816191673279
0 references
