TriangleFree Planar Graphs as Segments Intersection GraphsDe Castro, Natalia and Cobos, F. J. and Dana, J. C. and Márquez, Alberto and Noy, M. (1999) TriangleFree Planar Graphs as Segments Intersection Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 1519, 1999 , pp. 341350(Official URL: http://dx.doi.org/10.1007/3540466487_35). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540466487_35
AbstractWe prove that every trianglefree 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.
Actions (login required)
