Removing Independently Even Crossings

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2010) Removing Independently Even Crossings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 201-206(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_20).

Full text not available from this repository.

Abstract

We show that cr(G) ≤ 2 iocr(G) settling an open problem of Pach and Tóth [5,1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-11805-0_20
Classifications: G Algorithms and Complexity > G.420 Crossings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1098

Actions (login required)

View Item View Item