Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete |
scientific article |
Statements
Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (English)
0 references
23 December 2016
0 references
graph coloring
0 references
SAT
0 references
computational complexity
0 references
monochromatic cycles
0 references
0 references
