Saturated k-Plane Drawings with Few Edges

by   Fabian Klute, et al.

A drawing of a graph is k-plane if no edge is crossed more than k times. In this paper we study saturated k-plane drawings with few edges. This are k-plane drawings in which no edge can be added without violating k-planarity. For every number of vertices n>k+1, we present a tight construction with n-1/k+1 edges for the case in which the edges can self-intersect. If we restrict the drawings to be ℓ-simple we show that the number of edges in saturated k-plane drawings must be higher. We present constructions with few edges for different values of k and ℓ. Finally, we investigate saturated straight-line k-plane drawings.


page 1

page 2

page 3

page 4


Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...

Maximizing Ink in Partial Edge Drawings of k-plane Graphs

Partial edge drawing (PED) is a drawing style for non-planar graphs, in ...

Some Polycubes Have No Edge-Unzipping

It is unknown whether or not every polycube has an edge-unfolding. A pol...

On the Edge Crossings of the Greedy Spanner

t-spanners are used to approximate the pairwise distances between a set ...

On the enumeration of plane bipolar posets and transversal structures

We show that plane bipolar posets (i.e., plane bipolar orientations with...

Plane-Casting: 3D Cursor Control with a SmartPhone

We present Plane-Casting, a novel technique for 3D object manipulation f...

Equitable partition of plane graphs with independent crossings into induced forests

The cluster of a crossing in a graph drawing on the plane is the set of ...