A note on stable sets and colorings of graphs
Poljak, Svatopluk
Commentationes Mathematicae Universitatis Carolinae, Tome 015 (1974), p. 307-309 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1974-01-01
Classification:  05C15,  68A20 
@article{105554,
     author = {Svatopluk Poljak},
     title = {A note on stable sets and colorings of graphs},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     volume = {015},
     year = {1974},
     pages = {307-309},
     zbl = {0284.05105},
     mrnumber = {0351881},
     language = {en},
     url = {http://dml.mathdoc.fr/item/105554}
}

Poljak, Svatopluk. A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 015 (1974) pp. 307-309. http://gdmltest.u-ga.fr/item/105554/

C. Berge Graphs and hypergraphs, North-Holland, Amsterdam, 1972. (1972) | MR 0809587

V. Chvátal Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math. 4 (1973), 305-337. (1973) | MR 0313080

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

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