Castro Ochoa, Natalia deCobos Gavala, JavierDana Jiménez, Juan CarlosMárquez Pérez, AlbertoNoy, Marc2016-01-272016-01-271999http://hdl.handle.net/11441/33433We 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Computer ApplicationsComputer GraphicsDiscrete Mathematics in Computer ScienceAlgorithm Analysis and Problem ComplexityCombinatoricsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/3-540-46648-7_35