|
|||||
|
|
Planar Graphs Have 1-string Representations |
|
| Authors: | Jérémie Chalopin Daniel Gonçalves Pascal Ochem |
| Affiliation: | 1. LIF, CNRS et Aix-Marseille Université, CMI, 39 rue Joliot-Curie, 13453, Marseille Cedex 13, France 2. LIRMM, CNRS et Université Montpellier 2, 161 rue Ada, 34392, Montpellier Cedex 05, France 3. LRI, CNRS et Université Paris-Sud, Bat 490, 91405, Orsay Cedex, France |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |