On fan-crossing and fan-crossing free graphs
DOI10.1016/J.IPL.2018.06.006zbMATH Open1458.68139OpenAlexW2808996259WikidataQ129684627 ScholiaQ129684627MaRDI QIDQ1653045FDOQ1653045
Authors: Franz J. Brandenburg 
Publication date: 17 July 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.06.006
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Ein Sechsfarbenproblem auf der Kugel
- Density of straight-line 1-planar graph drawings
- Right angle crossing graphs and 1-planarity
- Outer 1-planar graphs
- 1-planarity of graphs with a rotation system
- Algorithms for graphs embeddable with few crossings per edge
- Drawing graphs with right angle crossings
- Title not available (Why is that?)
- Recognizing optimal 1-planar graphs in linear time
- A linear-time algorithm for testing outer-1-planarity
- On grids in topological graphs
- Über 1-optimale Graphen
- An annotated bibliography on 1-planarity
- Bar 1-visibility graphs and their relation to other nearly planar graphs
- Topological graphs with no large grids
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Fan-planarity: properties and complexity
- \(\mathsf{NIC}\)-planar graphs
- A first order logic definition of beyond-planar graphs
- Beyond outerplanarity
Cited In (11)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Crossing numbers of beyond-planar graphs
- On fan-crossing graphs
- Title not available (Why is that?)
- Straight-line drawings of 1-planar graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- Characterizing 5-map graphs by 2-fan-crossing graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- On optimal beyond-planar graphs
- Efficient generation of different topological representations of graphs beyond-planarity
This page was built for publication: On fan-crossing and fan-crossing free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653045)
