Graphs with Large Obstacle Numbers

DOI10.1007/978-3-642-16926-7_27zbMath1310.05145OpenAlexW1533523998MaRDI QIDQ3057633

János Pach, Padmini Mukkamala, Deniz Sarıöz

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_27

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

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, Drawing graphs using a small number of obstacles, On obstacle numbers

Cites Work

• Excluding induced subgraphs. II: Extremal graphs
• Ramsey-type theorems
• A combinatorial distinction between the Euclidean and projective planes
• Extremal problems in discrete geometry
• Obstacle numbers of graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• Arrangements of segments that share endpoints: Single face results
• Blocking visibility for points in general position
• The number of polytopes, configurations and real matroids
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• Coloring a Family of Circular Arcs
• Split Graphs Having Dilworth Number Two
• Visibility Algorithms in the Plane
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item