Dominating sets in plane triangulations
Copyright policy )Dominating sets in plane triangulations
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.
14 pages, 6 figures; Revised lemmas 6-8, clarified arguments and fixed typos, result unchanged
- Hobart and William Smith Colleges United States
- Illinois Institute of Technology United States
domination number, dominating set, Triangulation, Theoretical Computer Science, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Dominating set, 05C10, 05C69, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, plane triangulation, triangulated disc, Combinatorics (math.CO)
domination number, dominating set, Triangulation, Theoretical Computer Science, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Dominating set, 05C10, 05C69, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, plane triangulation, triangulated disc, Combinatorics (math.CO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).21 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!