Geodesic
Random procedures for dominating sets in bipartite graphs
Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 2, pp. 277-288

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

Using multilinear functions and random procedures, new upper bounds on the domination number of a bipartite graph in terms of the cardinalities and the minimum degrees of the two colour classes are established.
Keywords: domination, bipartite graph, multilinear function, random procedure 
@article{DMGT_2010_30_2_a9,
     author = {Artmann, Sarah and Harant, Jochen},
     title = {Random procedures for dominating sets in bipartite graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {277--288},
     publisher = {mathdoc},
     volume = {30},
     number = {2},
     year = {2010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a9/}
}
TY  - JOUR
AU  - Artmann, Sarah
AU  - Harant, Jochen
TI  - Random procedures for dominating sets in bipartite graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2010
SP  - 277
EP  - 288
VL  - 30
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a9/
LA  - en
ID  - DMGT_2010_30_2_a9
ER  - 
%0 Journal Article
%A Artmann, Sarah
%A Harant, Jochen
%T Random procedures for dominating sets in bipartite graphs
%J Discussiones Mathematicae. Graph Theory
%D 2010
%P 277-288
%V 30
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a9/
%G en
%F DMGT_2010_30_2_a9
Artmann, Sarah; Harant, Jochen. Random procedures for dominating sets in bipartite graphs. Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 2, pp. 277-288. http://geodesic.mathdoc.fr/item/DMGT_2010_30_2_a9/