Planar Graphs Have 1-string Representations

Journal article

Open access

Peer reviewed

Discrete and Computational Geometry, Vol.43((3)), pp.626-647

01/04/2010

Abstract

Planar graphs

Strings

We prove that every planar graph is an intersection graph of strings in the plane such that any two strings intersect at most once.

url

Find in HALView

url

https://doi.org/10.1007/s00454-009-9196-9View

Published (Version of record) Open

1 Record Views

Title: Planar Graphs Have 1-string Representations
Creators - without role: Jérémie Chalopin - Aix-Marseille Université
Daniel Gonçalves - Université de Montpellier
Pascal Ochem - Laboratoire de Recherche en Informatique
Publication Details: Discrete and Computational Geometry, Vol.43((3)), pp.626-647
Identifiers: 9947432909311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-00433091