Removing independently even crossings

  • Authors:

  • Michael J. Pelsmajer;Marcus Schaefer;Daniel Štefankovič

  • Affiliations:

  • DePaul University, Chicago, IL;Illinois Institute of Technology, Chicago, IL;University of Rochester, Rochester, NY

  • Venue:
  • GD'09 Proceedings of the 17th international conference on Graph Drawing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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