Planar graph emulators: Fellows' conjecture – Mgr. et Mgr. Martin Derka, M.Sc.
Mgr. et Mgr. Martin Derka, M.Sc.
Bachelor's thesis
Planar graph emulators: Fellows' conjecture
Planar graph emulators: Fellows' conjecture
Anotácia:
This paper deals with the problem which graphs have finite planar emulators and the related Fellows' conjecture (stated in 1985). It was open for more than 20 years until the end of 2008, when it was surprisingly disproved. It turned out that we actually do not know much about the class of non-projective graphs with finite planar emulators and this field became open for new research. In the paper we …viacAbstract:
This paper deals with the problem which graphs have finite planar emulators and the related Fellows' conjecture (stated in 1985). It was open for more than 20 years until the end of 2008, when it was surprisingly disproved. It turned out that we actually do not know much about the class of non-projective graphs with finite planar emulators and this field became open for new research. In the paper we …viac
Jazyk práce: English
Datum vytvoření / odevzdání či podání práce: 24. 5. 2010
Identifikátor:
https://is.muni.cz/th/dexcp/
Obhajoba závěrečné práce
- Obhajoba proběhla 23. 6. 2010
- Vedúci: prof. RNDr. Petr Hliněný, Ph.D.
- Oponent: doc. Mgr. Jan Obdržálek, PhD.
Plný text práce
Obsah online archivu závěrečné práce
Zveřejněno v Theses:- světu
Jak jinak získat přístup k textu
Instituce archivující a zpřístupňující práci: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / odbor:
Informatics / Informatics
Práce na příbuzné téma
-
New challenges in planar emulators
Martin Derka -
Construction of planar emulators of graphs
Matěj Klusáček