DeepAI
Log In Sign Up

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

08/31/2019
by   Patrizio Angelini, et al.
0

A simple topological graph is k-quasiplanar (k≥ 2) if it contains no k pairwise crossing edges, and k-planar if no edge is crossed more than k times. In this paper, we explore the relationship between k-planarity and k-quasiplanarity to show that, for k ≥ 2, every k-planar simple topological graph can be transformed into a (k+1)-quasiplanar simple topological graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/25/2020

Simple Topological Drawings of k-Planar Graphs

Every finite graph admits a simple (topological) drawing, that is, a dra...
11/21/2019

Implementing the Topological Model Succinctly

We show that the topological model, a semantically rich standard to repr...
12/28/2017

Beyond-Planarity: Density Results for Bipartite Graphs

Beyond-planarity focuses on the study of geometric and topological graph...
09/25/2017

Topological directions in Cops and Robbers

We present the first survey of its kind on results at the intersection o...
11/18/2019

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration

Given graphs G and H, we propose a method to implicitly enumerate topolo...
10/08/2018

An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs

We consider the problem of incremental cycle detection and topological o...