Random procedures for dominating sets in graphs

zbMath1230.05222MaRDI QIDQ986706

Sarah Artmann, Dieter Rautenbach, Ingo Schiermeyer, Frank Göring, Jochen Harant

Publication date: 12 August 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228104

zbMATH Keywords

independenceprobabilistic methoddomination

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 graphs