## Triangle-Free Planar Graphs as Segments Intersection Graphs
De Castro, Natalia and Cobos, F. J. and Dana, J. C. and Márquez, Alberto and Noy, M.
(1999)
Full text not available from this repository. ## AbstractWe prove that every triangle-free planar graph is the graph of intersection 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.
Repository Staff Only: item control page References |