Repositorio de producción científica de la Universidad de Sevilla

Triangle-Free Planar Graphs as Segment Intersection Graphs

 

Advanced Search
 
Opened Access Triangle-Free Planar Graphs as Segment Intersection Graphs
Cites

Show item statistics
Icon
Export to
Author: Castro Ochoa, Natalia de
Cobos Gavala, Javier
Dana Jiménez, Juan Carlos
Márquez Pérez, Alberto
Noy, Marc
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2002
Published in: Journal of Graph Algorithms and Applications, 6 (1), 7-26.
Document type: Article
Abstract: 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.
Size: 111.1Kb
Format: PDF

URI: http://hdl.handle.net/11441/34090

DOI: 10.7155/jgaa.00043

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)