Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
From MaRDI portal
Publication:510554
DOI10.1016/J.ENDM.2016.09.020zbMATH Open1356.05100OpenAlexW2537802768MaRDI QIDQ510554FDOQ510554
Gregorio Hernández, Mafalda Martins, Irene Castro, Santiago Canales
Publication date: 13 February 2017
Full work available at URL: http://oa.upm.es/48744/
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On dominating sets of maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Dominating sets in planar graphs
- Distance domination, guarding and covering of maximal outerplanar graphs
- Dominating sets whose closed stars form spanning trees
- Semitotal domination in graphs
- Total domination in maximal outerplanar graphs. II.
Cited In (8)
- Total domination in plane triangulations
- Combinatorial bounds on paired and multiple domination in triangulations
- Semipaired domination in maximal outerplanar graphs
- Extensions of the Art Gallery Theorem
- Partial domination of maximal outerplanar graphs
- On dominating sets of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- An upper bound on the algebraic connectivity of outerplanar graphs
This page was built for publication: Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510554)
