| Title:
|
A note on stable sets and colorings of graphs (English) |
| Author:
|
Poljak, Svatopluk |
| Language:
|
English |
| Journal:
|
Commentationes Mathematicae Universitatis Carolinae |
| ISSN:
|
0010-2628 (print) |
| ISSN:
|
1213-7243 (online) |
| Volume:
|
15 |
| Issue:
|
2 |
| Year:
|
1974 |
| Pages:
|
307-309 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C15 |
| MSC:
|
68A20 |
| idZBL:
|
Zbl 0284.05105 |
| idMR:
|
MR0351881 |
| . |
| Date available:
|
2008-06-05T20:44:43Z |
| Last updated:
|
2012-04-27 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/105554 |
| . |
| Reference:
|
[1] C. BERGE: Graphs and hypergraphs.North-Holland, Amsterdam, 1972. MR 0809587 |
| Reference:
|
[2] V. CHVÁTAL: Edmonds polytopes and a hierarchy of combinatorial problems.Discrete Math. 4 (1973), 305-337. MR 0313080 |
| Reference:
|
[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. |
| Reference:
|
[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 0378476 |
| . |
