A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
Kevin Buchin, Christian Knauer, Klaus Kriegel, And...