Dominating plane triangulations
From MaRDI portal
Abstract: In 1996, Tarjan and Matheson proved that if is a plane triangulated disc with vertices, , where denotes the domination number of . Furthermore, they conjectured that the constant could be improved to for sufficiently large . Their conjecture remains unsettled. In the present paper, it is proved that if is a hamiltonian plane triangulation with vertices and minimum degree at least 4, then . It follows immediately that if is a 4-connected plane triangulation with vertices, then . It then follows that if , then .
Recommendations
Cites work
- A Theorem on Planar Graphs
- A note on the domination number of triangulations
- DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
- Dominating sets in planar graphs
- Dominating sets in plane triangulations
- Dominating sets in triangulations on surfaces
- On certain spanning subgraphs of embeddings with applications to domination
- On dominating sets of maximal outerplanar graphs
Cited in
(11)- Total domination in plane triangulations
- Domination of triangulated discs and maximal outerplanar graphs
- Domination number of annulus triangulations
- Independent dominating sets in planar triangulations
- Dominating sets in plane triangulations
- The domination number of plane triangulations
- Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
- On certain spanning subgraphs of embeddings with applications to domination
- Dominating maximal outerplane graphs and Hamiltonian plane triangulations
- Dominating sets in triangulations on surfaces
- A note on the domination number of triangulations
This page was built for publication: Dominating plane triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335349)