Dominating Sets in Plane Triangulations

Details Dominating Sets in Plane Triangulations Dominating Sets in Plane Triangulations

2008-06-15

arxiv.org/abs/0806.2421v2

Mathematics

Combinatorics

14 pages, 6 figures; Revised lemmas 6-8, clarified arguments and fixed typos, result unchanged

Scientific paper

In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with
n sufficiently large has a dominating set of size at most n/4. We prove this
for graphs of maximum degree 6.

Affiliated with

Also associated with

No associations

Rating

Dominating Sets in Plane Triangulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dominating Sets in Plane Triangulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dominating Sets in Plane Triangulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-258252