Discrete & Computational Geometry

, Volume 28, Issue 4, pp 593–606

Recognizing String Graphs Is Decidable

Authors

  • Pach
    • Courant Institute, New York University, New York, NY 10012, USA pach@cims.nyu.edu
  • Tóth
    • Rényi Institute, Hungarian Academy of Sciences, POB 127, H-1364, Budapest, Hungary geza@math-inst.hu
Article

DOI: 10.1007/s00454-002-2891-4

Cite this article as:
Pach & Tóth Discrete Comput Geom (2002) 28: 593. doi:10.1007/s00454-002-2891-4

Abstract

A graph is called a string graph if its vertices can be represented by continuous curves (“strings”) in the plane so that two of them cross each other if and only if the corresponding vertices are adjacent. It is shown that there exists a recursive function f(n) with the property that every string graph of n vertices has a representation in which any two curves cross at most f(n) times. We obtain as a corollary that there is an algorithm for deciding whether a given graph is a string graph. This solves an old problem of Benzer (1959), Sinden (1966), and Graham (1971).

Download to read the full article text

Copyright information

© Springer-Verlag New York Inc. 2002