Project

Hypohamiltonian and Almost Hypohamiltonian Graphs

Code
01DI1015
Duration
01 September 2015 → 31 August 2016
Funding
Regional and community funding: Special Research Fund
Research disciplines
  • Natural sciences
    • History and foundations
Keywords
Hypohamiltonian Planar graphs Grinberg’s Criterion
 
Project description

Motivated by problems of (among others) Chvátal, Grünbaum, and Thomassen we study hypohamiltonian, graphs. The planar case will play a special role. We also study the connection between hypotraceable and almost hypohamiltonian graphs and related problems such as constructing k-connected graphs in which any j vertices are missed by a longest cycle or path.