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.
10.7151/dmgt.1494 Zitier-Link kopieren
DOI (10.7151/dmgt.1494)
https://doi.org/10.7151/dmgt.1494
URN (urn:nbn:de:gbv:ilm1-2020200176)
https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2020200176
Nutzung und Vervielfältigung: