Quasi-planar Graphs

Eyal Ackerman

doi:10.1007/978-981-15-6533-5_3

Quasi-planar Graphs

Eyal Ackerman

Faculty of Natural Sciences

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

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 language	English
Title of host publication	Beyond Planar Graphs
Subtitle of host publication	Communications of NII Shonan Meetings
Publisher	Springer Singapore
Pages	31-45
Number of pages	15
ISBN (Electronic)	9789811565335
ISBN (Print)	9789811565328
DOIs	https://doi.org/10.1007/978-981-15-6533-5_3
State	Published - 1 Jan 2020

Bibliographical note

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

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1007/978-981-15-6533-5_3

Cite this

@inbook{fb4842d6b22a4cb79990a010b8005c7f,

title = "Quasi-planar Graphs",

abstract = "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.",

author = "Eyal Ackerman",

note = "Publisher Copyright: {\textcopyright} Springer Nature Singapore Pte Ltd. 2020.",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-981-15-6533-5\_3",

language = "English",

isbn = "9789811565328",

pages = "31--45",

booktitle = "Beyond Planar Graphs",

publisher = "Springer Singapore",

address = "Singapore",

}

TY - CHAP

T1 - Quasi-planar Graphs

AU - Ackerman, Eyal

PY - 2020/1/1

Y1 - 2020/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85151211193

U2 - 10.1007/978-981-15-6533-5_3

DO - 10.1007/978-981-15-6533-5_3

M3 - Chapter

AN - SCOPUS:85151211193

SN - 9789811565328

SP - 31

EP - 45

BT - Beyond Planar Graphs

PB - Springer Singapore

ER -

Quasi-planar Graphs

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this