Computational Complexity and Graph Theory Graph Coloring Problems
| Thesis title in Czech: | Computational Complexity and Graph Theory Graph Coloring Problems |
|---|---|
| Thesis title in English: | |
| Academic year of topic announcement: | 2001/2002 |
| Thesis type: | dissertation |
| Thesis language: | |
| Department: | Department of Applied Mathematics (32-KAM) |
| Supervisor: | prof. RNDr. Jan Kratochvíl, CSc. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 01.10.2001 |
| Date of assignment: | 01.10.2001 |
| Date and time of defence: | 30.08.2004 13:00 |
| Date of electronic submission: | 30.08.2004 |
| Date of submission of printed version: | 30.08.2004 |
| Date of proceeded defence: | 30.08.2004 |
| Opponents: | prof. RNDr. Jaroslav Nešetřil, DrSc. |
| Prof. Magnus M. Halldorson | |