Bar k-Visibility Graphs
From MaRDI portal
Publication:5301404
DOI10.7155/jgaa.00136zbMath1161.68651OpenAlexW2113807202MaRDI QIDQ5301404
Joshua D. Laison, Alice M. Dean, Ellen Gethner, William S. Evans, Mohammad Ali Safari, William T. jun. Trotter
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55400
Related Items (22)
Visibility representations of boxes in 2.5 dimensions ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ Special graph representation and visualization of semantic networks ⋮ Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ Visibility representations of toroidal and Klein-bottle graphs ⋮ L-visibility drawings of IC-planar graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Minimal Embedding Dimensions of Rectangle k-Visibility Graphs ⋮ Simultaneous visibility representations of undirected pairs of graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Coloring non-crossing strings ⋮ On Aligned Bar 1-Visibility Graphs ⋮ Linear bounds on matrix extremal functions using visibility hypergraphs ⋮ Unnamed Item ⋮ 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 k-Visibility Graphs