Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 2025

3-colorable planar graphs have an intersection segment representation using 3 slopes

Résumé

In his PhD Thesis E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L. Isenmann, and C. Pennarun. In the case of 3-colorable planar graphs E.R. Scheinerman conjectured that it is possible to restrict the set of slopes used by the segments to only 3 slopes. Here we prove this conjecture by using an approach introduced by S. Felsner to deal with contact representations of planar graphs with homothetic triangles.

Fichier principal
Vignette du fichier
2511.20368v1.pdf (466.83 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05409566 , version 1 (10-12-2025)

Licence

Identifiants

Citer

Daniel Gonçalves. 3-colorable planar graphs have an intersection segment representation using 3 slopes. Journal of Combinatorial Theory, Series B, 2025, 177, pp.234-256. ⟨10.1016/j.jctb.2025.11.005⟩. ⟨hal-05409566⟩
50 Consultations
88 Téléchargements

Altmetric

Partager

  • More