Random procedures for dominating sets in bipartite graphs

Sarah Artmann, Jochen. Harant
2010 Discussiones Mathematicae Graph Theory  
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.
doi:10.7151/dmgt.1494 fatcat:oalhb3ob2jgczptlwpp4kp6sxa