Highly Influenced

5 Excerpts

- Published 1998 in Discrete Applied Mathematics

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.

@article{Brause1998ALB,
title={A lower bound on the independence number of a graph in terms of degrees and local clique sizes},
author={Christoph Brause and Bert Randerath and Dieter Rautenbach and Ingo Schiermeyer},
journal={Discrete Applied Mathematics},
year={1998},
volume={209},
pages={59-67}
}