Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs

DOI10.7155/jgaa.00343zbMath1305.05160arXiv1312.5520OpenAlexW2962978712MaRDI QIDQ2938759

Michael Kaufmann, Tamara Mchedlidze, William J. Lenhart, Stephen K. Wismath, William S. Evans

Publication date: 15 January 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.5520

zbMATH Keywords

1-planar graphsquasi-planar graphsplanar 1-flow networksstrong bar 1-visibility graphweak bar 1-visibility graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Flows in graphs (05C21)

Related Items (16)

Visibility representations of boxes in 2.5 dimensions ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ On fan-crossing and fan-crossing free graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ L-visibility drawings of IC-planar graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ On Aligned Bar 1-Visibility Graphs ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ Quasi-planar Graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ A Linear-Time Algorithm for Finding Induced Planar Subgraphs

This page was built for publication: Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs