On the recognition of fan-planar and maximal outer-fan-planar graphs
From MaRDI portal
Publication:2408919
DOI10.1007/s00453-016-0200-5zbMath1372.68201OpenAlexW2570781789MaRDI QIDQ2408919
Michael A. Bekos, Michael Kaufmann, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong
Publication date: 10 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0200-5
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ On fan-crossing and fan-crossing free graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ The family of fan-planar graphs ⋮ On fan-crossing graphs ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Gap-Planar Graphs ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Characterizing 5-map graphs by 2-fan-crossing graphs ⋮ Gap-planar graphs ⋮ Beyond Planar Graphs: Introduction ⋮ Fan-Planar Graphs ⋮ 1-planarity testing and embedding: an experimental study ⋮ 2-Layer k-Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- Drawing graphs with right angle crossings
- The structure of 1-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Establishing order in planar subdivisions
- Graphs drawn with few crossings per edge
- Checking the convexity of polytopes and the planarity of subdivisions
- Quasi-planar graphs have a linear number of edges
- Right angle crossing graphs and 1-planarity
- The density of fan-planar graphs
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- Algorithms for graphs embeddable with few crossings per edge
- A Linear-Time Algorithm for Testing Outer-1-Planarity
- Recognizing Outer 1-Planar Graphs in Linear Time
- On the Number of Edges of Fan-Crossing Free Graphs
- Fáry’s Theorem for 1-Planar Graphs
- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
- The Straight-Line RAC Drawing Problem is NP-Hard
- Über 1-optimale Graphen
- Crossing Number is NP-Complete
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
- The Number of Edges in $k$-Quasi-planar Graphs
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
- Discrete and Computational Geometry
This page was built for publication: On the recognition of fan-planar and maximal outer-fan-planar graphs
