For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
10.7151/dmgt.1335 Zitier-Link kopieren
DOI (10.7151/dmgt.1335)
https://doi.org/10.7151/dmgt.1335
URN (urn:nbn:de:gbv:ilm1-2020200134)
https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2020200134
Nutzung und Vervielfältigung: