Dominating sets in planar graphs
From MaRDI portal
Publication:1922883
DOI10.1006/eujc.1996.0048zbMath0862.05032OpenAlexW1981421358MaRDI QIDQ1922883
Lesley R. Matheson, Robert Endre Tarjan
Publication date: 19 May 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e530ecaafbc30e739b38b7740f7ced08ad1884b8
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (40)
Dominating sets inducing large components ⋮ Dominating plane triangulations ⋮ Bounds for the connected domination number of maximal outerplanar graphs ⋮ The domination number of plane triangulations ⋮ Independent domination, colorings and the fractional idomatic number of a graph ⋮ Dominating maximal outerplane graphs and Hamiltonian plane triangulations ⋮ On the general position numbers of maximal outerplane graphs ⋮ Partial domination of maximal outerplanar graphs ⋮ Connected domination in maximal outerplanar graphs ⋮ Total domination in maximal outerplanar graphs. II. ⋮ 3-component domination numbers in graphs ⋮ On dominating sets of maximal outerplanar and planar graphs ⋮ Disjoint total dominating sets in near‐triangulations ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ On the domination of triangulated discs ⋮ Extensions of the Art Gallery Theorem ⋮ A note on vertices contained in the minimum dominating set of a graph with minimum degree three ⋮ Dominating sets in triangulations on surfaces ⋮ Dominating sets of maximal outerplanar graphs ⋮ Total domination in plane triangulations ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs ⋮ Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs ⋮ Total domination in maximal outerplanar graphs ⋮ Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph ⋮ A tight bound on the number of mobile servers to guarantee transferability among dominating configurations ⋮ Dominating sets in plane triangulations ⋮ Combinatorial bounds on paired and multiple domination in triangulations ⋮ Achromatic number and facial achromatic number of connected locally-connected graphs ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Domination and outer connected domination in maximal outerplanar graphs ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Isolation number of maximal outerplanar graphs ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Double domination in maximal outerplanar graphs ⋮ Semipaired domination in maximal outerplanar graphs ⋮ A Note on the Domination Number of Triangulations
This page was built for publication: Dominating sets in planar graphs
