Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005)
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: Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8954586386680603
0 references
0.8168275952339172
0 references
0.7870927453041077
0 references
0.7821221351623535
0 references
