TY - GEN

T1 - Gap-planar graphs

AU - Bae, Sang Won

AU - Baffier, Jean Francois

AU - Chun, Jinhee

AU - Eades, Peter

AU - Eickmeyer, Kord

AU - Grilli, Luca

AU - Hong, Seok Hee

AU - Korman, Cozzetti Matias

AU - Montecchiani, Fabrizio

AU - Rutter, Ignaz

AU - Tóth, Csaba D.

N1 - Funding Information:
Research started at the NII Shonan Meeting “Algorithmics for Beyond Planar Graphs.” The authors thank the organizers, and Yota Otachi for useful discussions. Bae was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2015R1D1A1A01057220). Baffier was supported by JST-ERATO Grant Number JPMJER1201, Japan. Eades and Hong were partially supported by ARC DP160104148. Korman was partially supported by MEXT KAKENHI No. 15H02665, 17K12635 and JST ERATO Grant Number JPMJER1305. Tóth was supported in part by the NSF awards CCF-1422311 and CCF-1423615.
Publisher Copyright:
© Springer International Publishing AG 2018.

PY - 2018

Y1 - 2018

N2 - We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k of its crossings. This definition finds motivation in edge casing, as a k-gap-planar graph can be drawn crossing-free after introducing at most k local gaps per edge. We obtain results on the maximum density, drawability of complete graphs, complexity of the recognition problem, and relationships with other families of beyond-planar graphs.

AB - We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k of its crossings. This definition finds motivation in edge casing, as a k-gap-planar graph can be drawn crossing-free after introducing at most k local gaps per edge. We obtain results on the maximum density, drawability of complete graphs, complexity of the recognition problem, and relationships with other families of beyond-planar graphs.

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

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

U2 - 10.1007/978-3-319-73915-1_41

DO - 10.1007/978-3-319-73915-1_41

M3 - Conference contribution

AN - SCOPUS:85041799045

SN - 9783319739144

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 531

EP - 545

BT - Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers

A2 - Ma, Kwan-Liu

A2 - Frati, Fabrizio

PB - Springer Verlag

T2 - 25th International Symposium on Graph Drawing and Network Visualization, GD 2017

Y2 - 25 September 2017 through 27 September 2017

ER -