|
|
|
|
Литература
|
|
| |
| 1. |
G. Agnarsson, M. M. Halldoŕsson, “Strong Colorings of Hypergraphs”, Approximation and Online Algorithms, Lecture Notes in Computer Science, 3351, 2005, 253–266    |
| 2. |
N. Alon, Z. Bregman, “Every 8-uniform 8-regular hypergraph is 2-colorable”, Graphs Combinat., 4 (1988), 303–305  |
| 3. |
N. Alon, J. Spencer, The probabilistic method, Wiley-Interscience, New York, 2000 |
| 4. |
J. Beck, “On a combinatorial problem of P. Erdős and L. Lovász”, Discrete Math., 17 (1977), 127–131 |
| 5. |
J. Beck, “On 3-chromatic hypergraphs”, Discrete Math., 24 (1978), 127–137 |
| 6. |
P. Erdős, “On a combinatorial problem”, Nordisk Mat. Tidskr., 11 (1963), 5–10 |
| 7. |
P. Erdős, “On a combinatorial problem”, Acta Math Acad. Sci. Hungar., 15 (1964), 445–447 |
| 8. |
P. Erdős L. Lovász, “Problems and results on 3-chromatic hypergraphs and some related questions”, Infinite and finite sets, Colloq. Math. Soc. J. Bolyai, 10, North Holland, Amsterdam, 1974, 609–627 |
| 9. |
L. Hong-Jian, B. Montgomery, H. Poon, “Upper Bounds of Dynamic Chromatic Number”, Ars. Combinatoria, 68 (2003), 193–201 |
| 10. |
A. Kostochka, “Coloring uniform hypergraphs with few colors”, Random Structures and Algorithms, 24 (2004), 1–10 |
| 11. |
A. Pluhár, “Greedy colorings of uniform hypergraphs”, Random Structures and Algorithms, 35 (2009), 216–221 |
| 12. |
W. M. Schmidt, “Ein kombinatoriches problem”, Acta Math. Acad. Sci. Hungar., 15 (1964), 373–374 |
| 13. |
J. H. Spencer, “Coloring $n$-sets red and blue”, J. Combin Theory Ser. A, 30 (1981), 112–113 |
| 14. |
C. Thomassen, “The even cycle problem for directed graphs”, J. Amer. Math. Soc., 5 (1992), 217–229 |
| 15. |
Н. В. Гравин, “Невырожденные раскраски в теореме Брукса”, Дискр. матем., 21:4 (2009), 105–128   |
| 16. |
Д. В. Карпов, “Динамические правильные раскраски вершин графа”, Зап. научн. семин. ПОМИ, 381, 2010, 47–77 |
