An annotated bibliography on 1-planarity

Stephen G. Kobourov, Giuseppe Liotta, Fabrizio Montecchiani

Research output: Research - peer-reviewReview article

  • 1 Citations

Abstract

The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computational geometry. This annotated bibliography aims to provide a guiding reference to researchers who want to have an overview of the large body of literature about 1-planar graphs. It reviews the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. As an additional contribution, we offer a list of open problems on 1-planar graphs.

LanguageEnglish (US)
Pages49-67
Number of pages19
JournalComputer Science Review
Volume25
DOIs
StatePublished - Aug 1 2017

Fingerprint

Planarity
Planar graph
Bibliography
Computational geometry
Graph theory
Bibliographies
Graph in graph theory
Geometric Representation
Graph Drawing
Graph Algorithms
Computational Geometry
Date
Open Problems
Covering
Generalization
Review

Keywords

  • 1-planarity
  • Annotated bibliography
  • Beyond planar graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

An annotated bibliography on 1-planarity. / Kobourov, Stephen G.; Liotta, Giuseppe; Montecchiani, Fabrizio.

In: Computer Science Review, Vol. 25, 01.08.2017, p. 49-67.

Research output: Research - peer-reviewReview article

Kobourov SG, Liotta G, Montecchiani F. An annotated bibliography on 1-planarity. Computer Science Review. 2017 Aug 1;25:49-67. Available from, DOI: 10.1016/j.cosrev.2017.06.002
Kobourov, Stephen G. ; Liotta, Giuseppe ; Montecchiani, Fabrizio. / An annotated bibliography on 1-planarity. In: Computer Science Review. 2017 ; Vol. 25. pp. 49-67
@article{58f31e638b4949f6a3361c165c37f10c,
title = "An annotated bibliography on 1-planarity",
abstract = "The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computational geometry. This annotated bibliography aims to provide a guiding reference to researchers who want to have an overview of the large body of literature about 1-planar graphs. It reviews the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. As an additional contribution, we offer a list of open problems on 1-planar graphs.",
keywords = "1-planarity, Annotated bibliography, Beyond planar graphs",
author = "Kobourov, {Stephen G.} and Giuseppe Liotta and Fabrizio Montecchiani",
year = "2017",
month = "8",
doi = "10.1016/j.cosrev.2017.06.002",
volume = "25",
pages = "49--67",
journal = "Computer Science Review",
issn = "1574-0137",
publisher = "Elsevier Ireland Ltd",

}

TY - JOUR

T1 - An annotated bibliography on 1-planarity

AU - Kobourov,Stephen G.

AU - Liotta,Giuseppe

AU - Montecchiani,Fabrizio

PY - 2017/8/1

Y1 - 2017/8/1

N2 - The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computational geometry. This annotated bibliography aims to provide a guiding reference to researchers who want to have an overview of the large body of literature about 1-planar graphs. It reviews the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. As an additional contribution, we offer a list of open problems on 1-planar graphs.

AB - The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computational geometry. This annotated bibliography aims to provide a guiding reference to researchers who want to have an overview of the large body of literature about 1-planar graphs. It reviews the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. As an additional contribution, we offer a list of open problems on 1-planar graphs.

KW - 1-planarity

KW - Annotated bibliography

KW - Beyond planar graphs

UR - http://www.scopus.com/inward/record.url?scp=85021792718&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021792718&partnerID=8YFLogxK

U2 - 10.1016/j.cosrev.2017.06.002

DO - 10.1016/j.cosrev.2017.06.002

M3 - Review article

VL - 25

SP - 49

EP - 67

JO - Computer Science Review

T2 - Computer Science Review

JF - Computer Science Review

SN - 1574-0137

ER -