Constructing a dominating set for bipartite graphs in several rounds

Artmann, Sarah GND; Pruchnewski, Anja

Using the probabilistic method, 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.

Cite

Citation style:

Artmann, Sarah / Pruchnewski, Anja: Constructing a dominating set for bipartite graphs in several rounds. 2009.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export