Gap-planar graphs

Sang Won Bae, Jean Francois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok Hee Hong, Cozzetti Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルGraph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers
編集者Kwan-Liu Ma, Fabrizio Frati
出版社Springer Verlag
ページ531-545
ページ数15
ISBN(印刷版)9783319739144
DOI
出版ステータスPublished - 2018
イベント25th International Symposium on Graph Drawing and Network Visualization, GD 2017 - Boston, United States
継続期間: 2017 9月 252017 9月 27

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10692 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other25th International Symposium on Graph Drawing and Network Visualization, GD 2017
国/地域United States
CityBoston
Period17/9/2517/9/27

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Gap-planar graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル