scientific article; zbMATH DE number 7561382
From MaRDI portal
Publication:5091019
DOI10.4230/LIPIcs.ISAAC.2018.28MaRDI QIDQ5091019
No author found.
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1712.09855
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
An annotated review on graph drawing and its applications ⋮ The thickness of fan-planar graphs is at most three ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ On RAC drawings of graphs with one bend per edge ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Fan-Planar Graphs ⋮ 2-Layer k-Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Outer 1-planar graphs
- Recognizing and drawing IC-planar graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- A linear-time algorithm for testing outer-1-planarity
- Drawing graphs with right angle crossings
- An upper bound on the number of edges in an almost planar bipartite graph
- A characterization of complete bipartite RAC graphs
- Improving the crossing lemma by finding more crossings in sparse graphs
- On an extremal problem in the class of bipartite 1-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Recognizing optimal 1-planar graphs in linear time
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Right angle crossing graphs and 1-planarity
- On topological graphs with at most four crossings per edge
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- On some extremal problems in graph theory
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- On the Density of Non-simple 3-Planar Graphs
- Re-embeddings of Maximum 1-Planar Graphs
- The Straight-Line RAC Drawing Problem is NP-Hard
- Crossing-Free Subgraphs
- Efficient Planarity Testing
- Two-Planar Graphs Are Quasiplanar
- The Number of Edges in $k$-Quasi-planar Graphs
- On a problem of P. Turan concerning graphs
- Disjoint edges in geometric graphs
This page was built for publication:
