Lower bounds on the obstacle number of graphs

zbMath1243.05176arXiv1103.2724MaRDI QIDQ426912

János Pach, Padmini Mukkamala, Dömötör Pálvölgyi

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

visibility graphgraph representationobstacle number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Grid obstacle representation of graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Obstructing Visibilities with One Obstacle ⋮ Unnamed Item ⋮ Drawing graphs using a small number of obstacles ⋮ On obstacle numbers ⋮ Geodesic obstacle representation of graphs

This page was built for publication: Lower bounds on the obstacle number of graphs