Closing complexity gaps for coloring problems on \(H\)-free graphs (Q4909517)
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: Closing complexity gaps for coloring problems on H-free graphs |
scientific article; zbMATH DE number 6147787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closing complexity gaps for coloring problems on \(H\)-free graphs |
scientific article; zbMATH DE number 6147787 |
Statements
Closing Complexity Gaps for Coloring Problems on H-Free Graphs (English)
0 references
21 March 2013
0 references
0.992639422416687
0 references
0.8720828294754028
0 references
0.8693256974220276
0 references
0.8634284138679504
0 references
0.8612256646156311
0 references
