Geodesic
On the Complexity of Reinforcement in Graphs
Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 877-887

Voir la notice de l'article provenant de la source Library of Science

We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.
Keywords: domination, total domination, total restrained domination, p- domination, k-rainbow domination, reinforcement, NP-hard 
@article{DMGT_2016_36_4_a8,
     author = {Rad, Nader Jafari},
     title = {On the {Complexity} of {Reinforcement} in {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {877--887},
     publisher = {mathdoc},
     volume = {36},
     number = {4},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a8/}
}
TY  - JOUR
AU  - Rad, Nader Jafari
TI  - On the Complexity of Reinforcement in Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2016
SP  - 877
EP  - 887
VL  - 36
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a8/
LA  - en
ID  - DMGT_2016_36_4_a8
ER  - 
%0 Journal Article
%A Rad, Nader Jafari
%T On the Complexity of Reinforcement in Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2016
%P 877-887
%V 36
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a8/
%G en
%F DMGT_2016_36_4_a8
Rad, Nader Jafari. On the Complexity of Reinforcement in Graphs. Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 4, pp. 877-887. http://geodesic.mathdoc.fr/item/DMGT_2016_36_4_a8/