AI Chat AI Image Generator AI Video Text to Speech

Crossing Numbers of Beyond-Planar Graphs

08/08/2019

∙

by Markus Chimani, et al.

∙

∙

We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are n-vertex 1-planar (quasi-planar, fan-planar) graphs such that any 1-planar (quasi-planar, fan-planar) drawing has Ω(n) crossings, while O(1) crossings suffice in a crossing-minimal drawing without restrictions on local edge crossing patterns.

Markus Chimani
20 publications
Philipp Kindermann
25 publications
Fabrizio Montecchiani
37 publications
Pavel Valtr
17 publications

page 1

page 2

page 3

page 4

research

∙ 05/26/2021

Crossing Numbers of Beyond-Planar Graphs Revisited

Graph drawing beyond planarity focuses on drawings of high visual qualit...

0 Nathan van Beusekom, et al. ∙

research

∙ 06/26/2018

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

We study the following classes of beyond-planar graphs: 1-planar, IC-pla...

0 Steven Chaplick, et al. ∙

research

∙ 08/26/2018

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

We show that the 1-planar slope number of 3-connected cubic 1-planar gra...

0 Philipp Kindermann, et al. ∙

research

∙ 12/15/2020

Edge-Minimum Saturated k-Planar Drawings

For a class 𝒟 of drawings of loopless multigraphs in the plane, a drawin...

0 Steven Chaplick, et al. ∙

research

∙ 08/25/2023

Min-k-planar Drawings of Graphs

The study of nonplanar drawings of graphs with restricted crossing confi...

0 Carla Binucci, et al. ∙

research

∙ 11/14/2019

New Bounds on k-Planar Crossing Numbers

The crossing number cr(G) of a graph G is the minimum number of crossing...

0 Alireza Shavali, et al. ∙

research

∙ 08/21/2020

2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth

The 2-layer drawing model is a well-established paradigm to visualize bi...

0 Patrizio Angelini, et al. ∙