Triangle-free planar graphs as segment intersection graphs

Journal of Graph Algorithms and Applications

Volumn 6, Issue 1, 2002, Pages 7-26

  De Castro, Natalia ^a   Cobos, Francisco Javier ^a   Dana, Juan Carlos ^a   Márquez, Alberto ^a   Noy, Marc ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPHIC METHODS;

CONTACT GRAPHS; INTERIOR POINT; INTERSECTION GRAPH; PLANAR GRAPH; SEGMENT INTERSECTIONS; TRIANGLE-FREE;

GRAPH THEORY;

EID: 4043090524     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00043     Document Type: Conference Paper

References (12)

1. D.W. Barnette. On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs In The many facets of graph theory. Lectures Notes in Mathematics Springer, Berlin, 110:27-39, 1969.
2. I. Ben-Arroyo Hartman, I. Newman and R. Ziv. On grid intersection graphs. In Discrete Math., 87:41-52, 1991.
3. P. Hlineny. Contact graphs of line segments are NP-complete. In Discrete Math., 235:95-106, 2001.
4. H. de Fraysseix, P. Osona de Mendez and J. Pach. Representation of planar graphs by segments. In Colloquia Mathematica Societatis János Bolyai, Intuitive Geometry, Szeged (Hungary), 1991.
5. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
6. J. Kratochvíl. A special planar satisfiability problem and a consequence of its NP-completeness. In Discrete Applied Math., 52:233-252, 1994.
7. J. Kratochvíl and J. Matoušek. Intersection graphs of segments. In J. of Comb. Theory, Serie B, 62:289-315, 1994.
8. W. Naji. Reconnaisance des graphes de cordes. In Discrete Math., 54:329-337, 1985.
9. E.R. Scheinerman. Intersection classes and multiple intersection parameters of graphs. Ph D. thesis,, Princeton University, 1984.
10. J. Spinrad. Recognition of circle graphs. In J. of Algorithms, 16:264-282, 1994.
11. R. Tamassia and I.G. Tollis. A unified approach to visibility representation of planar graphs. In Discrete and Computational Geometry, 1:321-341, 1986.
12. C. Thomassen. Grötzsch's 3-colour theorem and its counterparts for the torus and the projective plane. In J. Comb. Theory B, 62:268-279, 1994.