Professor Daniel Paulusma's Outputs (2)

New Bounds for the Snake-in-the-Box Problem (2019)
Report
Allison, D., & Paulusma, D. (2019). New Bounds for the Snake-in-the-Box Problem. [No known commissioning body]

The Snake-in-the-Box problem is that of finding a longest induced path in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {11, 12, 13}. The Coil-in-the-Box problem is that of finding a longest induced cycle in an n-dimensiona... Read More about New Bounds for the Snake-in-the-Box Problem.

On Finding Paths Passing through Specified Vertices (2011)
Report
Paulusma, D. (2011). On Finding Paths Passing through Specified Vertices. [No known commissioning body]

We consider undirected finite graphs that have no loops and no multiple edges. A graph is denoted G = (VG, EG), where VG is the set of vertices and EG is the set of edges. A graph containment problem is to decide whether one graph can be modified int... Read More about On Finding Paths Passing through Specified Vertices.