Triangle-Free Planar Graphs and Segment Intersection Graphs | Zendy

Natalia de Castro | Zendy; Francisco Javier Molina Cobos | Zendy; Juan Carlos Dana | Zendy; Alberto Márquez | Zendy; Marc Noy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Triangle-Free Planar Graphs and Segment Intersection Graphs

Author(s) -

Natalia de Castro,

Francisco Javier Molina Cobos,

Juan Carlos Dana,

Alberto Márquez,

Marc Noy

Publication year - 2002

Publication title -

journal of graph algorithms and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.387

H-Index - 38

ISSN - 1526-1719

DOI - 10.7155/jgaa.00043

Subject(s) - chordal graph , intersection (aeronautics) , combinatorics , planar graph , planar , outerplanar graph , computer science , 1 planar graph , mathematics , pathwidth , graph , geography , line graph , computer graphics (images) , cartography

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research