Geodesic
A note on stable sets and colorings of graphs
Commentationes Mathematicae Universitatis Carolinae, Tome 15 (1974) no. 2, pp. 307-309 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C15, 68A20 
@article{CMUC_1974_15_2_a8,
     author = {Poljak, Svatopluk},
     title = {A note on stable sets and colorings of graphs},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     pages = {307--309},
     year = {1974},
     volume = {15},
     number = {2},
     mrnumber = {0351881},
     zbl = {0284.05105},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMUC_1974_15_2_a8/}
}
TY  - JOUR
AU  - Poljak, Svatopluk
TI  - A note on stable sets and colorings of graphs
JO  - Commentationes Mathematicae Universitatis Carolinae
PY  - 1974
SP  - 307
EP  - 309
VL  - 15
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/CMUC_1974_15_2_a8/
LA  - en
ID  - CMUC_1974_15_2_a8
ER  - 
%0 Journal Article
%A Poljak, Svatopluk
%T A note on stable sets and colorings of graphs
%J Commentationes Mathematicae Universitatis Carolinae
%D 1974
%P 307-309
%V 15
%N 2
%U http://geodesic.mathdoc.fr/item/CMUC_1974_15_2_a8/
%G en
%F CMUC_1974_15_2_a8
Poljak, Svatopluk. A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 15 (1974) no. 2, pp. 307-309. http://geodesic.mathdoc.fr/item/CMUC_1974_15_2_a8/

[1] C. BERGE: Graphs and hypergraphs. North-Holland, Amsterdam, 1972. | MR

[2] V. CHVÁTAL: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 (1973), 305-337. | MR

[3] S. A. COOK: The complexity of theorem-proving procedures. in: Conference record of the third ACM symposium on theory of computing (1970), 151-158.

[4] R. M. KARP: Reducibility among combinatorial problems. in: R. E. Miller et al., eds., Complexity of computer computations (Plenum Press, New York, 1972). | MR