A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481)
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: A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length |
scientific article; zbMATH DE number 6715033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length |
scientific article; zbMATH DE number 6715033 |
Statements
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (English)
0 references
12 May 2017
0 references
graph coloring
0 references
fixed-parameter tractability
0 references
0.8954586386680603
0 references
0.7944799065589905
0 references
0.7788968682289124
0 references
0.7772396206855774
0 references
0.7726799845695496
0 references
