Obstacle numbers of graphs
From MaRDI portal
Publication:977184
DOI10.1007/s00454-009-9233-8zbMath1216.05088OpenAlexW2047417978MaRDI QIDQ977184
Hannah Alpert, Joshua D. Laison, Christina Koch
Publication date: 21 June 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9233-8
circular arc graphvisibility graphinterval bigraphobstacle numberconvex obstacle numbernon-double-covering circular arc graphproper circular arc graph
Related Items (13)
Grid obstacle representation of graphs ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Obstructing Visibilities with One Obstacle ⋮ Unnamed Item ⋮ Outside-obstacle representations with all vertices on the outer face ⋮ Drawing graphs using a small number of obstacles ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ A characterization of 2-tree proper interval 3-graphs ⋮ Graphs with Large Obstacle Numbers ⋮ On obstacle numbers ⋮ Geodesic obstacle representation of graphs
Cites Work
- Two remarks on circular arc graphs
- Circular-arc graphs with clique cover number two
- Small Ramsey numbers
- Linear-time recognition of circular-arc graphs
- Algorithmic graph theory and perfect graphs
- Matrix characterizations of circular-arc graphs
- Research Problems in Discrete Geometry
- Topics in Intersection Graph Theory
- The Erdos-Szekeres problem on points in convex position – a survey
- Interval bigraphs and circular arc graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Polynomial time recognition of unit circular-arc graphs
- Characterizing circular-arc graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Obstacle numbers of graphs
