Fabrizio Montecchiani

Advances on 1-planar graphs

VCLA hosting a talk by Fabrizio Montecchiani

DATE:Tuesday, January 15, 2019
TIME:11:00 s.t.
VENUE:Algorithms and Complexity library, HB 04 08


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 in the plane 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 talk reviews some of the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. It also includes relevant open problems.


Martin Nöllenburg

Fabrizio Montecchiani, University of Perugia

Comments are closed.