A note on stable sets and colorings of graphs
Commentationes Mathematicae Universitatis Carolinae (1974)
- Volume: 015, Issue: 2, page 307-309
- ISSN: 0010-2628
Access Full Article
top
How to cite
topPoljak, Svatopluk. "A note on stable sets and colorings of graphs." Commentationes Mathematicae Universitatis Carolinae 015.2 (1974): 307-309. <http://eudml.org/doc/16622>.
@article{Poljak1974,
author = {Poljak, Svatopluk},
journal = {Commentationes Mathematicae Universitatis Carolinae},
language = {eng},
number = {2},
pages = {307-309},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {A note on stable sets and colorings of graphs},
url = {http://eudml.org/doc/16622},
volume = {015},
year = {1974},
}
TY - JOUR
AU - Poljak, Svatopluk
TI - A note on stable sets and colorings of graphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1974
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 015
IS - 2
SP - 307
EP - 309
LA - eng
UR - http://eudml.org/doc/16622
ER -
References
top- C. BERGE, Graphs and hypergraphs, North-Holland, Amsterdam, 1972. (1972) MR0809587
- V. CHVÁTAL, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math. 4 (1973), 305-337. (1973) MR0313080
- 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) MR0378476
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.