Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs

@article{Fulek2013ConvexON,
  title={Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs},
  author={Radoslav Fulek and Noushin Saeedi and Deniz Sari{\"o}z},
  journal={ArXiv},
  year={2013},
  volume={abs/1104.4656}
}
  • Radoslav Fulek, Noushin Saeedi, Deniz Sariöz
  • Published 2013
  • Mathematics, Computer Science
  • ArXiv
  • The disjoint convex obstacle number of a graph G is the smallest number h such that there is a set of h pairwise disjoint convex polygons (obstacles) and a set of n points in the plane [corresponding to V (G))]so that a vertex pair uv is an edge if and only if the corresponding segment \(\overline{uv}\) does not meet any obstacle. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 12 CITATIONS

    Drawing Graphs Using a Small Number of Obstacles

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Obstacle Numbers of Planar Graphs

    VIEW 1 EXCERPT
    CITES BACKGROUND

    On Obstacle Numbers

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Homometric sets in diameter-two and outerplanar graphs

    • Slobodan Mitrovic
    • Mathematics
    • MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference
    • 2014
    VIEW 4 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Graphs with Obstacle Number Greater than One

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES

    Obstacle Numbers of Graphs

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Graphs with Large Obstacle Numbers

    VIEW 2 EXCERPTS

    Bipartite permutation graphs

    VIEW 2 EXCERPTS

    Heath and Arnold L . Rosenberg . Laying out graphs using queues

    • Padmini Mukkamala
    • SIAM J . Comput .

    The number of planar graphs and properties of random planar graphs

    • Omer Giménez, Marc Noy
    • International Conference on Analysis of Algorithms, Conrado Mart́ınez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD,
    • 2005
    VIEW 1 EXCERPT