Monotone drawings of planar graphs

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

Volumn 2518 LNCS, Issue , 2002, Pages 647-653

  Pach, János ^a   Tóth, Géza ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

PLANAR GRAPH; MONOTONE CURVES; STRAIGHT-LINE SEGMENTS;

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

EID: 84867999110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_57     Document Type: Conference Paper

References (7)

1. Ch. Chojnacki (A. Hanani), Über wesentlich unplättbare Kurven im drei-dimensionalen Raume, Fund. Math. 23 (1934), 135-142.
2. G. Cairns and Y. Nikolayevsky, Bounds for generalized thrackles, Discrete Comput. Geom. 23 (2000), 191-206.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.
4. G. Ehrlich, S. Even, and R. E. Tarjan, Intersection graphs of curves in the plane, Journal of Combinatorial Theory, Series B 21 (1976), 8-20.
5. I. Fary, On straight line representation of planar graphs, Acta Univ. Szeged. Sect. Sci. Math. 11 (1948), 229-233.
6. W. T. Tutte, Toward a theory of crossing numbers, J. Combinatorial Theory 8 (1970), 45-53.
7. K. Wagner, Bemerkungen zum Vierfarbenproblem, Jber. Deutsch. math. Vereinigung 46 (1936), 26-32.