Fan-crossing free graphs and their relationship to other beyond-planar graphs
From MaRDI portal
Publication:2663047
DOI10.1016/j.tcs.2021.03.031zbMath1465.68208arXiv2003.08468OpenAlexW3151266200MaRDI QIDQ2663047
Publication date: 15 April 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.08468
Related Items (4)
Straight-line drawings of 1-planar graphs ⋮ The family of fan-planar graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outer 1-planar graphs
- Recognizing and drawing IC-planar graphs
- On crossing numbers of hypercubes and cube connected cycles
- Drawing graphs with right angle crossings
- Area-efficient static and incremental graph drawings
- On the maximum number of edges in quasi-planar graphs
- L-visibility drawings of IC-planar graphs
- Embedding planar graphs in four pages
- The book thickness of a graph
- Quasi-planar graphs have a linear number of edges
- Algorithms for area-efficient orthogonal drawing
- On fan-crossing and fan-crossing free graphs
- Recognizing optimal 1-planar graphs in linear time
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- On the planar split thickness of graphs
- Gap-planar graphs
- Right angle crossing graphs and 1-planarity
- On representations of some thickness-two graphs
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- On topological graphs with at most four crossings per edge
- On fan-crossing graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- On grids in topological graphs
- Characterizing 5-map graphs by 2-fan-crossing graphs
- Fan-planarity: properties and complexity
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- The book thickness of 1-planar graphs is constant
- \(\mathsf{NIC}\)-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- 1-Visibility Representations of 1-Planar Graphs
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
- Re-embeddings of Maximum 1-Planar Graphs
- The Straight-Line RAC Drawing Problem is NP-Hard
- Über 1-optimale Graphen
- Chromatic number, independence ratio, and crossing number
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Universality considerations in VLSI circuits
- Crossing-Free Subgraphs
- Geometric Thickness of Complete Graphs
- A First Order Logic Definition of Beyond-Planar Graphs
- Data Structures and their Planar Graph Layouts
- On the Density of Maximal 1-Planar Graphs
- Beyond Planar Graphs
- Planar Graphs Have Bounded Queue-Number
- 1-Planarity of Graphs with a Rotation System
- Bar k-Visibility Graphs
- The crossing number of K11 is 100
- The crossing number of K5,n
- On Aligned Bar 1-Visibility Graphs
- On the Perspectives Opened by Right Angle Crossing Drawings
This page was built for publication: Fan-crossing free graphs and their relationship to other beyond-planar graphs
