A characterization of planar graphs by pseudo-line arrangements

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

Volumn 1350, Issue , 1997, Pages 133-142

  Tamaki, Hisao ^a   Tokuyama, Takeshi ^b  

^a MEIJI UNIVERSITY   (Japan)

^b IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CROSSING POINT; MONOTONE CURVES; ORDERED PAIRS; PLANAR GRAPH; PSEUDO-LINE ARRANGEMENTS; PSEUDO-LINES; UPPER BOUND;

GRAPH THEORY;

EID: 21944439637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_16     Document Type: Conference Paper

References (12)

1. M. Ajtai, V. Chvátal, M.M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Ann. Discrete Math. 12 (1982), 9-12.
2. P.K. Agarwal, B. Aronov, and M. Sharir, On Levels in Arrangements of Lines, Segments, Planes, and Triangles, Proc. 13th Symposium on Computational Geometry, 1997, 30-38.
3. T.K. Dey, Improved Bounds for k-sets and k-th Levels, manuscript, 1997.
4. P. Erdös, L. Lovász, A. Simmons, and E.G. Straus. Dissection graphs of planar point sets. In A Survey of Combinatorial Theory, J.N. Srivastava et al., eds., 1973, 139-149, North-HOlland, Amsterdam.
5. I. Fáry. On straight line representation of planar graphs. Acta Sci. Math. Szeged., 11, 229-33, 1948.
6. L. Lovász. On the number of halving lines. Ann. Univ. Sci. Budapest, Eötös, Soc. Math. 14 (1971), 107-108.
7. J. Matougek, Combinatorial and algorithmic geometry, Unpublished lecture notes, 1996.
8. G.H. Meister, Polygons have ears, Amer. Math. Mon. 82, 1975, 648-651.
9. J. Pack and P.K. Agarwal, Combinatorial Geometry, John Wiley and Sons, 1995.
10. J. Pach, W. Steiger, and E. Szemerédi. An upper bound on the number of planar k-sets. In Proe. 30th Ann. IEEE Symposium on Foundation of Computer Science, 1989, 72-79.
11. H. Tamaki and T. Tokuyama, How to cut pseudo-parabolas into segments, In Proc. 11th Symposium on Computational Geometry, 1995, 230-237.
12. H. Tamaki and T. Tokuyama, A characterization of planar graphs by pseudo-line arrangements, manuscript, August 1997.