Quasi-planar Graphs

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


A graph is k-quasi-planar if it can be drawn in the plane such that no k of its edges are pairwise crossing. Thus, the class of k-quasi-planar graphs contains all planar graphs and several other classes of beyond-planar graphs. The research of k-quasi-planar graphs began in the early 1990s and has focused mainly on upperbounding their size which is conjectured to be linear. Recently, with the emergence  of interest in beyond-planar graphs within the Graph Drawing community, other properties of k-quasi-planar graphs have also been investigated. In this chapter, we survey the literature on k-quasi-planar graphs. Specifically, we mention the progress made toward determining theirmaximal size, their relationships to other graph classes and a couple of related algorithmic questions.

Original languageEnglish
Title of host publicationBeyond Planar Graphs
Subtitle of host publicationCommunications of NII Shonan Meetings
PublisherSpringer Singapore
Number of pages15
ISBN (Electronic)9789811565335
ISBN (Print)9789811565328
StatePublished - 1 Jan 2020

Bibliographical note

Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2020.

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Quasi-planar Graphs'. Together they form a unique fingerprint.

Cite this