A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1668077 |
Changed an Item |
||
| Property / author | |||
| Property / author: Yaroslav N. Shitov / rank | |||
Normal rank | |||
Revision as of 05:18, 29 February 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
