1-fan-bundle-planar drawings of graphs
From MaRDI portal
Publication:1708027
DOI10.1016/j.tcs.2018.03.005zbMath1392.68320arXiv1702.06163OpenAlexW2951616097WikidataQ130093213 ScholiaQ130093213MaRDI QIDQ1708027
Patrizio Angelini, Michael Kaufmann, Michael A. Bekos, Thomas Schneck, Philipp Kindermann
Publication date: 4 April 2018
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06163
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Approximating the Bundled Crossing Number ⋮ The family of fan-planar graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Unnamed Item ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Fan-Planar Graphs ⋮ Crossing Layout in Non-planar Graph Drawings
Cites Work
- Outer 1-planar graphs
- Circular right-angle crossing drawings in linear time
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- 2-layer right angle crossing drawings
- A linear-time algorithm for testing outer-1-planarity
- Drawing graphs with right angle crossings
- On the maximum number of edges in quasi-planar graphs
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- 1-fan-bundle-planar drawings of graphs
- The density of fan-planar graphs
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Bundled Crossings in Embedded Graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- The Straight-Line RAC Drawing Problem is NP-Hard
- Über 1-optimale Graphen
- Crossing Number is NP-Complete
- Gap-Planar Graphs
- Graph Drawing
- Unnamed Item
- Unnamed Item
This page was built for publication: 1-fan-bundle-planar drawings of graphs
