Random procedures for dominating sets in bipartite graphs
Sarah Artmann, Jochen Harant · Discussiones Mathematicae Graph Theory · 2010
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.