Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs

DOI10.1007/978-1-4614-0110-0_13zbMath1272.05130arXiv1104.4656OpenAlexW1585105437MaRDI QIDQ2849806

Noushin Saeedi, Radoslav Fulek, Deniz Sarıöz

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

graphobstaclesdisjoint convex obstacle numberpairwise disjoint convex polygons

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Grid obstacle representation of graphs ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Obstructing Visibilities with One Obstacle ⋮ Drawing graphs using a small number of obstacles ⋮ Obstacle Numbers of Planar Graphs ⋮ On obstacle numbers

This page was built for publication: Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs