Artículo
Triangle-Free Planar Graphs as Segment Intersection Graphs
Autor/es | Castro Ochoa, Natalia de
Cobos Gavala, Javier Dana Jiménez, Juan Carlos Márquez Pérez, Alberto Noy, Marc |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2002 |
Fecha de depósito | 2016-02-04 |
Publicado en |
|
Resumen | We prove that every triangle-free planar graph is the intersection graph
of a set of segments in the plane. Moreover, the segments can be chosen in
only three directions (horizontal, vertical and oblique) and in such a ... We prove that every triangle-free planar graph is the intersection graph of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a way that no two segments cross, i.e., intersect in a common interior point. This particular class of intersection graphs is also known as contact graphs. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Triangle-free planar.pdf | 111.1Kb | [PDF] | Ver/ | |