Blocking the \(k\)-holes of point sets in the plane

DOI10.1007/s00373-014-1488-zzbMath1321.05028OpenAlexW2007596557MaRDI QIDQ497316

Ferran Hurtado, Javier Cano, Jorge Urrutia, Alfredo Daniel Garcia, Toshinori Sakai, F. Javier Tejel

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1488-z

zbMATH Keywords

blockingpiercing\(k\)-holes

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Polytopes and polyhedra (52B99)

Related Items

Two disjoint 5-holes in point sets, Drawing the almost convex set in an integer grid of minimum size, On almost empty monochromatic triangles and convex quadrilaterals in colored point sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of diameter-2-critical graphs whose complements are diamond-free
• Empty monochromatic triangles
• On empty triangles determined by points in the plane
• Konvexe Fünfecke in ebenen Punktmengen
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• Covering the convex quadrilaterals of point sets
• On the chromatic number of some geometric type Kneser graphs
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Sets with No Empty Convex 7-Gons
• Thickness and Antithickness of Graphs
• A modular version of the Erdős– Szekeres theorem
• The Chromatic Number of the Convex Segment Disjointness Graph
• Planar point sets with a small number of empty convex polygons