Thesis supervisor: Gábor Wiener
Location of studies (in Hungarian): Department of Computer Science and Information Theory Abbreviation of location of studies: SZIT
Description of the research topic:
Detailed description of topic: Long paths and cycles, such as hamiltonian paths and cycles play an extremely important role in Graph Theory. We investigate several extensions of the problem of hamiltonicity and traceability, like hypohamiltonicity, hypotraceability, minimum leaf spanning trees, and spanning spiders.
Required language skills: English Further requirements: Fluent English or fluent Hungarian plus medium English
Sufficient background in Graph Theory
Number of students who can be accepted: 1
Deadline for application: 2018-07-31
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).