Planar Graphs Have 1-string Representations

Abstract : We prove that every planar graph is an intersection graph of strings in the plane such that any two strings intersect at most once.
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00433091
Contributor : Daniel Gonçalves <>
Submitted on : Wednesday, November 18, 2009 - 10:34:47 AM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM

Links full text

Identifiers

Citation

Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Planar Graphs Have 1-string Representations. Discrete and Computational Geometry, Springer Verlag, 2010, 43 ((3)), pp.626-647. ⟨10.1007/s00454-009-9196-9⟩. ⟨lirmm-00433091⟩

Share

Metrics

Record views

727