A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length |
scientific article |
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
