Project

Traceability and Hamiltonicity in Graphs with Connectivity Requirements

Duration
01 October 2016 → 30 September 2019
Funding
Research Foundation - Flanders (FWO)
Research disciplines
  • Natural sciences
    • History and foundations
Keywords
traceable hamiltonian Tutte-cycle
 
Project description

Using new results from the field of Tutte-cycles, we further develop the theory of hamiltonian paths and hamiltonian cycles in families of graphs obeying certain constraints, especially planarity and connectivity. Directions of research will be (i) extending hamiltonicity results on polyhedra, (ii) studying Gallai's problem on the intersection of all longest paths, and (iii) expanding the work on hypohamiltonicity.