Combinatorial bounds on paired and multiple domination in triangulations
type: Item
instance of: scholarly article
title: Combinatorial bounds on paired and multiple domination in triangulations
zbMATH Open document ID: 1397.05125
author: Santiago Canales
author: Irene Castro
author: Gregorio Hernández
publication date: 2018-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6951988
zbMATH Keywords: domination
zbMATH Keywords: maximal outerplanar graph
zbMATH Keywords: triangulation
MaRDI profile type: Publication
full work available at URL: j.endm.2018.06.014
OpenAlex ID: W2884941071
cites work: Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
cites work: Total domination in maximal outerplanar graphs. II.
cites work: Q3691778
cites work: Q4552196
cites work: Q4368728
cites work: Paired-domination in graphs
cites work: Dominating sets in planar graphs
cites work: Galleries need fewer mobile guards: A variation on Chvatal's theorem
cites work: Dominating sets of maximal outerplanar graphs
Wikidata QID: Q129518103
DOI: 10.1016/J.ENDM.2018.06.014
Recommended article: Upper bounds for the paired-domination numbers of graphs
Recommended article: Upper bounds on the paired-domination number
Recommended article: Bounds on the paired domination number of graphs with minimum degree at least three
Recommended article: A Note on the Domination Number of Triangulations
Recommended article: Q4318220
Recommended article: On upper bounds for multiple domination numbers of graphs
Recommended article: Upper bounds on the paired domination subdivision number of a graph
Recommended article: Q5461697
Recommended article: Q3378348
Recommended article: Bounds on the k-tuple domatic number of a graph
description: scientific article; zbMATH DE number 6951988