A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2017.02.005 / rank | |||
| Property / cites work | |||
| Property / cites work: Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2017.02.005 / rank | |||
Normal rank | |||
Latest revision as of 20:34, 9 December 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
