Code
bof/baf/2y/2024/01/014
Looptijd
01-01-2024 → 31-12-2024
Financiering
Regional and community funding: Special Research Fund
Promotor
Onderzoeksdisciplines
-
Natural sciences
- Combinatorics
- Applied discrete mathematics
Trefwoorden
Vlakke en Hamiltoniaanse grafen
Grafentheorie
Opspannende bomen
Cykels
Veelvlak
Projectomschrijving
In graph theory, a cycle in a graph is hamiltonian if it visits every vertex of the graph. Determining hamiltonicity is difficult and one of Karp's famous 21 NP-complete problems. Applications of hamiltonicity range from combinatorial optimisation – in particular, the Travelling Salesman Problem – and operations research over coding theory, theoretical computer science, molecular chemistry, and fault-tolerance in networks. My project is closely linked with the study of hamiltonian cycles and related structures. I will address a series of interconnected conjectures and problems on longest cycles and spanning subgraphs, with a special emphasis on planar 3-connected graphs, i.e. the 1-skeleta of polyhedra.