Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Tutte paths"”.
-
Tutte paths and even covers
A Tutte path of a graph G is a path P of G such that every component of G - P has at most three attachments on P. Tutte paths are well studied in the literature due to their applications towards the Hamiltonian cycle problem. We prove the existence of Tutte paths in which the number of components …
-
Counting Hamiltonian cycles in planar triangulations
… extended to all $4$-connected planar graphs by Tutte. Hakimi, Schmeichel, and Thomassen showed the first lower bound $n/\log _2 n$ for the number of Hamiltonian cycles in every $n$-vertex $4$-connected planar triangulation and, in the same paper, they conjectured that this number is at least …