Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such that each face of G is incident to an endpoint of an edge in Γ. Such a set is said to guard G. We improve the known upper bounds on the number of edges required to guard any n-vertex embedded planar graph G: 1- We present a simple inductive proof for a theorem of Everett and Rivera-Campo (1997) that G can be guarded with at most 2n/5 edges, then extend this approach with a deeper analysis to yield an improved bound of 3n/8 edges for any plane graph. 2- We prove that there exists an edge guard set of G with at most n/3+α/9 edges, where α is the number of quadrilateral faces in G. This improves the previous bound of n/3 + α by Bose, Kirkpatrick, and Li (2003). Moreover, if there is no short path between any two quadrilateral faces in G, we show that n/3 edges suffice, removing the dependence on α.

• 23 publications
• 34 publications
• 7 publications
• 5 publications
research
06/24/2020

Guarding Quadrangulations and Stacked Triangulations with Edges

Let G = (V,E) be a plane graph. A face f of G is guarded by an edge vw ∈...
research
12/03/2020

Saturated k-Plane Drawings with Few Edges

A drawing of a graph is k-plane if no edge is crossed more than k times....
research
09/06/2019

Bounds on Ramsey Games via Alterations

This note contains a refined alteration approach for constructing H-free...
research
03/08/2023

Improved Bounds for Covering Paths and Trees in the Plane

A covering path for a planar point set is a path drawn in the plane with...
research
03/08/2021

Random 2-cell embeddings of multistars

By using permutation representations of maps, one obtains a bijection be...
research
10/10/2018

An Edge Extrusion-Approach to Generate Extruded Miura-Ori and Its Double Tiling Origami Patterns

This paper proposes a family of origami tessellations called extruded Mi...
research
09/28/2018