On the relationship between k-planar and k-quasi-planar graphs
From MaRDI portal
(Redirected from Publication:1687902)
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
Abstract: A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. A graph is -quasi planar if it can be drawn in the plane with no pairwise crossing edges. The families of -planar and -quasi planar graphs have been widely studied in the literature, and several bounds have been proven on their edge density. Nonetheless, only trivial results are known about the relationship between these two graph families. In this paper we prove that, for , every -planar graph is -quasi planar.
Recommendations
Cited in
(14)- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Fan-planar graphs
- Upper bound on the sum of powers of the degrees of graphs with few crossings per edge
- Quasi-planar Graphs
- Two-Planar Graphs Are Quasiplanar
- Graph Drawing
- Gap-Planar Graphs
- Beyond outerplanarity
- On the density of non-simple 3-planar graphs
- Gap-planar graphs
- On quasi-planar graphs: clique-width and logical description
- Quantitative restrictions on crossing patterns
- \(k\)-planar graphs
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
This page was built for publication: On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687902)