Crossing Number of Abstract Topological Graphs

  • Jan Kratochvíl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

We revoke the problem of drawing graphs in the plane so that only certain specified pairs of edges are allowed to cross. We overview some previous results and open problems, namely the connection to intersection graphs of curves in the plane. We complement these by stating a new conjecture and showing that its proof would solve the problem of algorithmic decidability of recognition of string graphs as well as realizability of abstract topological graphs and feasible drawability of graphs with restricted edge crossings.

References

  1. 1.
    M.R. Garey, D.S. Johnson: Crossing number is NP-complete, SIAM J. Algebraic and Discrete Methods 4 (1983), 312–316MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    M.C. Golumbic: Algorithmic Graph theory and Perfect Graphs, Academic Press, New York, 1980MATHGoogle Scholar
  3. 3.
    J. Kratochvíl: String graphs II. Recognizing string graphs is NP-hard, J. Combin. Theory Ser. B 52 (1991), 67–78CrossRefGoogle Scholar
  4. 4.
    J. Kratochvíl, A. Lubiw, J. Nešetřil: Noncrossing subgraphs of topological layouts, SIAM J. Discrete Math. 4 (1991), 223–244MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    J. Kratochvíl, J. Matoušek: String graphs requiring exponential representations, J. Combin. Theory Ser. B 53 (1991), 1–4Google Scholar
  6. 6.
    F. Sharokhi, O. Sýkora, I. Vrto: Crossing numbers of graphs, lower bound techniques and algorithms: a survey, in: Proc. Graph Drawing’ 94, LNCS 894, Springer Verlag, Berlin, 1995, pp. 131–142Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jan Kratochvíl
    • 1
  1. 1.Charles UniversityPragueCzech Republic

Personalised recommendations