On Aligned Bar 1-Visibility Graphs

DOI10.1007/978-3-319-30139-6_8zbMath1475.68404OpenAlexW2463396024MaRDI QIDQ5890623

Daniel Neuwirth, Alexander Esch, Franz-Josef Brandenburg

Publication date: 3 May 2016

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_8

Mathematics Subject Classification ID

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)

Related Items

The density of fan-planar graphs

Cites Work

• Outer 1-planar graphs
• Recognizing and drawing IC-planar graphs
• A linear-time algorithm for testing outer-1-planarity
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A note on visibility graphs
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Right angle crossing graphs and 1-planarity
• On representations of some thickness-two graphs
• Fan-planarity: properties and complexity
• Ein Sechsfarbenproblem auf der Kugel
• Recognizing hole-free 4-map graphs in cubic time
• 1-Visibility Representations of 1-Planar Graphs
• On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
• Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
• Map graphs
• k-Quasi-Planar Graphs
• On the Density of Maximal 1-Planar Graphs
• On Bar (1,j)-Visibility Graphs
• Bar k-Visibility Graphs
• Parameters of Bar k-Visibility Graphs