Simple k-planar graphs are simple (k + 1)-quasiplanar-Reference-Cited by-同舟云学术

Simple k-planar graphs are simple (k + 1)-quasiplanar

Published:2020-05 Issue: Volume:142 Page:1-35
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Angelini Patrizio,Bekos Michael A.,Brandenburg Franz J.,Da Lozzo Giordano,Di Battista Giuseppe,Didimo Walter^ORCID,Hoffmann Michael^ORCID,Liotta Giuseppe,Montecchiani Fabrizio,Rutter Ignaz,Tóth Csaba D.^ORCID

Funder

Deutscher Akademischer Austauschdienst

Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

H2020 Marie Skłodowska-Curie Actions

National Science Foundation

Ministero dell’Istruzione, dell’Università e della Ricerca

Deutsche Forschungsgemeinschaft

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference27 articles.

1. On the maximum number of edges in topological graphs with no four pairwise crossing edges;Ackerman;Discrete Comput. Geom.,2009

2. On grids in topological graphs;Ackerman;Comput. Geom.,2014

3. On the maximum number of edges in quasi-planar graphs;Ackerman;J. Combin. Theory Ser. A,2007

4. Quasi-planar graphs have a linear number of edges;Agarwal;Combinatorica,1997

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Rotation Systems and Simple Drawings in Surfaces;The Electronic Journal of Combinatorics;2024-06-28

2. Graphs Drawn With Some Vertices per Face: Density and Relationships;IEEE Access;2024

3. Convex-Geometric k-Planar Graphs Are Convex-Geometric $$(k+1)$$-Quasiplanar;Lecture Notes in Computer Science;2024

4. Finding geometric representations of apex graphs is NP-hard;Theoretical Computer Science;2023-09

5. 2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth;The Computer Journal;2023-04-21