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

research
08/25/2020

Simple Topological Drawings of k-Planar Graphs

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

Implementing the Topological Model Succinctly

We show that the topological model, a semantically rich standard to repr...
research
12/02/2022

Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems

Given a complete simple topological graph G, a k-face generated by G is ...
research
02/07/2023

Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time

In this note, we give a proof of the fact that we can efficiently find d...
research
07/29/2021

Systematic Enumeration and Identification of Unique Spatial Topologies of 3D Systems Using Spatial Graph Representations

Systematic enumeration and identification of unique 3D spatial topologie...
research
05/07/2023

HybridNet: Dual-Branch Fusion of Geometrical and Topological Views for VLSI Congestion Prediction

Accurate early congestion prediction can prevent unpleasant surprises at...
research
07/16/2023

Short edges and noncrossing paths in complete topological graphs

Let h(n) be the minimum integer such that every complete n-vertex simple...

Please sign up or login with your details

Forgot password? Click here to reset