Some news about the independence number of a graph. Discussiones Mathematicae Graph Theory
| Author(s) : | Jochen Harant, |
| Publisher : | N/A |
| Publication Date : | 2000 |
| ISSN : | N/A |
| Abstract : | For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G., |