Geodesic
Some news about the independence number of a graph
Discussiones Mathematicae. Graph Theory, Tome 20 (2000) no. 1, pp. 71-79

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: graph, independence 
@article{DMGT_2000_20_1_a4,
     author = {Harant, Jochen},
     title = {Some news about the independence number of a graph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {71--79},
     publisher = {mathdoc},
     volume = {20},
     number = {1},
     year = {2000},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2000_20_1_a4/}
}
TY  - JOUR
AU  - Harant, Jochen
TI  - Some news about the independence number of a graph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2000
SP  - 71
EP  - 79
VL  - 20
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2000_20_1_a4/
LA  - en
ID  - DMGT_2000_20_1_a4
ER  - 
%0 Journal Article
%A Harant, Jochen
%T Some news about the independence number of a graph
%J Discussiones Mathematicae. Graph Theory
%D 2000
%P 71-79
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2000_20_1_a4/
%G en
%F DMGT_2000_20_1_a4
Harant, Jochen. Some news about the independence number of a graph. Discussiones Mathematicae. Graph Theory, Tome 20 (2000) no. 1, pp. 71-79. http://geodesic.mathdoc.fr/item/DMGT_2000_20_1_a4/