Domination in planar graphs with small diameter*
From MaRDI portal
Publication:4537553
Recommendations
Cites work
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Bounds related to domination in graphs with minimum degree two
- Domination in graphs with minimum degree two
- Domination numbers of planar graphs
- Domination-balanced graphs
- Large planar graphs with given diameter and maximum degree
- On Moore Graphs with Diameters 2 and 3
- Paths, Stars and the Number Three
Cited in
(33)- A note on domination number in maximal outerplanar graphs
- Total domination in planar graphs of diameter two
- Outerplanar and planar oriented cliques
- Planar domination graphs
- A note on the bounds of Roman domination numbers
- Domination and dominator colorings in planar graphs with small diameter
- scientific article; zbMATH DE number 2114677 (Why is no real title available?)
- Weak \(\{2\}\)-domination number of Cartesian products of cycles
- Nordhaus-Gaddum problems for power domination
- A survey of selected recent results on total domination in graphs
- Protection of lexicographic product graphs
- Domination in planar graphs with small diameter II.
- Total restrained domination in graphs of diameter 2 or 3
- On dominating sets of maximal outerplanar and planar graphs
- Witness rectangle graphs
- Bounds on the connected domination number of a graph
- Dominating sets in plane triangulations
- Total domination in graphs with diameter 2
- On oriented cliques with respect to push operation
- Some upper bounds for the domination number
- Domination numbers of planar graphs
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- The extended dominating sets in graphs
- A Survey of the Game “Lights Out!”
- The domination number of plane triangulations
- scientific article; zbMATH DE number 7597458 (Why is no real title available?)
- Power domination in planar graphs with small diameter
- scientific article; zbMATH DE number 2044937 (Why is no real title available?)
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs
- Triangle-free projective-planar graphs with diameter two: domination and characterization
- On the weak Roman domination number of lexicographic product graphs
- Paired domination in graphs
- VC-dimension and Erdős-Pósa property
This page was built for publication: Domination in planar graphs with small diameter*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537553)