Random procedures for dominating sets in graphs.
Artmann, Sarah; Göring, Frank; Harant, Jochen; Rautenbach, Dieter; Schiermeyer, Ingo — 2010
The Electronic Journal of Combinatorics [electronic only]
Random procedures for dominating sets in graphs.
Random procedures for dominating sets in bipartite graphs
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.
Page 1