Random procedures for dominating sets in bipartite graphs

DOI10.7151/dmgt.1494zbMath1214.05099OpenAlexW2086453344MaRDI QIDQ3059096

Sarah Artmann, Jochen Harant

Publication date: 8 December 2010

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00046452/2083-5892_30_2010_2_277-288.pdf

zbMATH Keywords

bipartite graphdominationmultilinear functionrandom procedure

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

New probabilistic upper bounds on the domination number of a graph

This page was built for publication: Random procedures for dominating sets in bipartite graphs