Crossing Number of Abstract Topological Graphs
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.
- 5.J. Kratochvíl, J. Matoušek: String graphs requiring exponential representations, J. Combin. Theory Ser. B 53 (1991), 1–4Google Scholar
- 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