On the maximum number of edges in quasi-planar graphs

Handbook of discrete and computational geometry

Choice Reviews Online · 1998 · 1.5K citations · Full text

Natural Sciences, Computer Science, Mathematics +12

Every planar map is four colorable

K. I. Appel, Wolfgang Haken · Bulletin of the American Mathematical Society · 1976 · 1.1K citations · Full text

Natural Sciences, Architectural Representation, Color Theory +5

Every planar map is four colorable. Part I: Discharging

K. I. Appel, Wolfgang Haken · Illinois Journal of Mathematics · 1977 · 879 citations

Architecture, Architectural Representation, Descriptive Geometry +2

Graphs drawn with few crossings per edge

János Pach · COMBINATORICA · 1997 · 299 citations · Full text

Computing, Mathematics, Combinatorics +13

Quasi-planar graphs have a linear number of edges

Pankaj K. Agarwal, Boris Aronov, J�nos Pach et al. · COMBINATORICA · 1997 · 128 citations · Full text

Natural Sciences, Mathematics, Combinatorics +4