Chromatic invariants in graph drawing
| Thesis title in Czech: | Chromatic invariants in graph drawing |
|---|---|
| Thesis title in English: | Chromatic invariants in graph drawing |
| Academic year of topic announcement: | 2005/2006 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| 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: | 08.11.2005 |
| Date of assignment: | 08.11.2005 |
| Date and time of defence: | 22.05.2006 00:00 |
| Date of electronic submission: | 22.05.2006 |
| Date of proceeded defence: | 22.05.2006 |
| Opponents: | doc. RNDr. Pavel Valtr, Dr. |
| Guidelines |
| The student will study available results on chromatic number and similar chromatic invariants (acyclic, oriented, star etc. chromatic numbers) in the context of special drawings and visibility representations of graphs. He will attempt to improve known bounds for maximum chromatic number of graphs representable in this way. |
| References |
| B. Bollobas: Modern Graph Theory, Graduate Texts in Mathematics, Springer 1998, ISBN 0-387-98488-7
T. Nishizeki, M. S. Rahman: Planar Graph Drawing, Lecture Notes Series on Computing 12, World Scientific, 2004, ISBN 981-256-033-5 D. Wood: Three-Dimensional Orthogonal Graph Drawing, PhD Thesis, Monash Univeristy, 2000 journal articles following instructions of the advisor |