\(\mathsf{T}\)-shape visibility representations of 1-planar graphs
From MaRDI portal
Publication:1702255
DOI10.1016/j.comgeo.2017.10.007zbMath1381.05048arXiv1702.05265OpenAlexW2594460933MaRDI QIDQ1702255
Publication date: 28 February 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.05265
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (6)
Optimal-area visibility representations of outer-1-plane graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Ortho-polygon visibility representations of 3-connected 1-plane graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Drawing graphs with right angle crossings
- Ortho-polygon visibility representations of embedded graphs
- How to draw a planar graph on a grid
- L-visibility drawings of IC-planar graphs
- Representing a planar graph by vertical lines joining different levels
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Some results on visibility graphs
- Computing an st-numbering
- An algorithm for straight-line drawing of planar graphs
- Drawing planar graphs using the canonical ordering
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Right angle crossing graphs and 1-planarity
- On representations of some thickness-two graphs
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- \(\mathsf{NIC}\)-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Recognizing hole-free 4-map graphs in cubic time
- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes
- Straight-Line Grid Drawings of 3-Connected 1-Planar 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
- Coloring plane graphs with independent crossings
- More Canonical Ordering
- Über 1-optimale Graphen
- Chromatic number, independence ratio, and crossing number
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Zur Struktur 1‐planarer Graphen
- Rectilinear drawings of graphs
- On-Line Planarity Testing
- A new proof of the 6 color theorem
- On the Density of Maximal 1-Planar Graphs
- On Bar (1,j)-Visibility Graphs
- 1-Planarity of Graphs with a Rotation System
- Bar k-Visibility Graphs
- Parameters of Bar k-Visibility Graphs
This page was built for publication: \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
