Back to Search
Start Over
Simple k-planar graphs are simple (k + 1)-quasiplanar.
- Source :
-
Journal of Combinatorial Theory - Series B . May2020, Vol. 142, p1-35. 35p. - Publication Year :
- 2020
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *PLANAR graphs
*EDGES (Geometry)
Subjects
Details
- Language :
- English
- ISSN :
- 00958956
- Volume :
- 142
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series B
- Publication Type :
- Academic Journal
- Accession number :
- 142144899
- Full Text :
- https://doi.org/10.1016/j.jctb.2019.08.006