Dominating sets in planar graphs
From MaRDI portal
Recommendations
Cited in
(60)- On certain spanning subgraphs of embeddings with applications to domination
- Weak \(\{2\}\)-domination number of Cartesian products of cycles
- Combinatorial bounds on paired and multiple domination in triangulations
- Achromatic number and facial achromatic number of connected locally-connected graphs
- Domination and outer connected domination in maximal outerplanar graphs
- Double domination in maximal outerplanar graphs
- 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
- Partial domination of maximal outerplanar graphs
- Connected domination in maximal outerplanar graphs
- Total domination in plane triangulations
- Convex dominating sets in maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- Semipaired domination in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- A refined search tree technique for dominating set on planar graphs
- Dominating sets inducing large components
- Extensions of the Art Gallery Theorem
- A note on vertices contained in the minimum dominating set of a graph with minimum degree three
- Dominating plane triangulations
- Fractional domatic, idomatic, and total domatic numbers of a graph
- A strengthened analysis of an algorithm for dominating set in planar graphs
- 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
- Dominating sets in triangulations on surfaces
- Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
- A note on the domination number of triangulations
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- On the general position numbers of maximal outerplane graphs
- 3-component domination numbers in graphs
- Disjoint total dominating sets in near‐triangulations
- On the domination of triangulated discs
- Secure total domination number in maximal outerplanar graphs
- Domination of triangulated discs and maximal outerplanar graphs
- Isolation of regular graphs and \(k\)-chromatic graphs
- A lower bound for secure domination number of an outerplanar graph
- Isolation of squares in graphs
- Solution to a 3-path isolation problem for subcubic graphs
- Isolation of regular graphs, stars and k-chromatic graphs
- Independent domination number of planar triangulations
- Bipartite domination in outerplanar graphs
- Proof of a conjecture on isolation of graphs dominated by a vertex
- Spanning trees for many different numbers of leaves
- Face-hitting dominating sets in planar graphs
- Connected domination in plane triangulations
- Independent dominating sets in planar triangulations (extended abstract)
- On 3-component domination numbers in graphs
- Dominating sets in plane triangulations
- Simple (invited talk)
- Disjunctive total domination in maximal outerplanar graphs
- Solution to a problem on isolation of 3-vertex paths
- Total domination in maximal outerplanar graphs. II.
- On dominating sets of maximal outerplanar and planar graphs
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
This page was built for publication: Dominating sets in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922883)
