DeepAI AI Chat
Log In Sign Up

Guarding Quadrangulations and Stacked Triangulations with Edges

by   Paul Jungeblut, et al.

Let G = (V,E) be a plane graph. A face f of G is guarded by an edge vw ∈ E if at least one vertex from {v,w} is on the boundary of f. For a planar graph class 𝒢 we ask for the minimal number of edges needed to guard all faces of any n-vertex graph in 𝒢. We prove that ⌊ n/3 ⌋ edges are always sufficient for quadrangulations and give a construction where ⌊ (n-2)/4 ⌋ edges are necessary. For 2-degenerate quadrangulations we improve this to a tight upper bound of ⌊ n/4 ⌋ edges. We further prove that ⌊ 2n/7 ⌋ edges are always sufficient for stacked triangulations (that are the 3-degenerate triangulations) and show that this is best possible up to a small additive constant.


page 1

page 2

page 3

page 4


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 ...

Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards

We study the problem of guarding an orthogonal polyhedron having reflex ...

Minimizing Visible Edges in Polyhedra

We prove that, given a polyhedron 𝒫 in ℝ^3, every point in ℝ^3 that does...

Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra

We present new examples of topologically convex edge-ununfoldable polyhe...

Random 2-cell embeddings of multistars

By using permutation representations of maps, one obtains a bijection be...

Tree-like distance colouring for planar graphs of sufficient girth

Given a multigraph G and a positive integer t, the distance-t chromatic ...

New (α,β) Spanners and Hopsets

An f(d)-spanner of an unweighted n-vertex graph G=(V,E) is a subgraph H ...