Triangle-free planar graphs as segments intersection graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1731, Issue , 1999, Pages 341-350

  De Castro, N ^a   Cobos, F J ^a   Dana, J C ^a   Marquez A ^a   Noy, M ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPHIC METHODS;

INTERIOR POINT; INTERSECTION GRAPH; PLANAR GRAPH; TRIANGLE-FREE;

GRAPH THEORY;

EID: 84958961958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_35     Document Type: Conference Paper

References (9)

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