3-colorability and contacts of segments

Patrice Ossona de Mendez (1)

1 CAMS - Centre d'Analyse et de Mathématique sociales

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]

Patrice Ossona de Mendez. 3-colorability and contacts of segments. Série du CAMS, 1999, 171, pp.1-2. ⟨hal-00008547⟩