3-colorability and contacts of segments
Résumé
Using a result on planar graph representation by contacts of triangles, we shall prove that vertex 3-colorability is NP-complete for simple contact graphs of segments in 4 directions.
Domaines
Combinatoire [math.CO]
Loading...