Efficient generation of different topological representations of graphs beyond-planarity
From MaRDI portal
Publication:2206855
DOI10.1007/978-3-030-35802-0_20OpenAlexW2990690875MaRDI QIDQ2206855
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.03042
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ Unnamed Item ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved enumeration of simple topological graphs
- 1-planarity of complete multipartite graphs
- Simple realizability of complete abstract topological graphs in P
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- How many ways can one draw a graph?
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Visibility representations of boxes in 2.5 dimensions
- On fan-crossing and fan-crossing free graphs
- 1-fan-bundle-planar drawings of graphs
- On the planar split thickness of graphs
- Gap-planar graphs
- The splitting number of the complete graph
- Right angle crossing graphs and 1-planarity
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- An Alternative Method to Crossing Minimization on Hierarchical Graphs
- The Crossing-Angle Resolution in Graph Drawing
- On the Number of Edges of Fan-Crossing Free Graphs
- A First Order Logic Definition of Beyond-Planar Graphs
- Progress on Partial Edge Drawings
- On a problem of P. Turan concerning graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Efficient generation of different topological representations of graphs beyond-planarity
