Skip to main content
Conference ProceedingsOPEN ACCESS

Removing independently even crossings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5849 LNCS 201-206
DOI: 10.1007/978-3-642-11805-0_20
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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

Cite

CITATION STYLE

APA

Pelsmajer, M. J., Schaefer, M., & Štefankovič, D. (2010). Removing independently even crossings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 201–206). https://doi.org/10.1007/978-3-642-11805-0_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free