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 3 of 3 for “"Hamiltonian-connected"”.

  1. K-ordered graphs and out-arc pancyclicity on digraphs

    Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties have also been considered. Some of the properties are weaker, for example traceability and existence of a cycle factor in graphs, while other are stronger, for example Hamiltonian-connectivity, …

    aachen Repository record for K-ordered graphs and out-arc pancyclicity on digraphs (opens in a new tab)

  2. Topics in the Generation of Ideals of Posets

    … between vertices that differ by a swap, has a Hamiltonian path. The conjecture is true for series-parallel posets and interval orders. We prove the conjecture also holds for the fence posets, but that the conjecture is false for the 3-ideals of the crown poset with six elements. We also provide …

    carleton Repository record for Topics in the Generation of Ideals of Posets (opens in a new tab)

  3. Hamiltonian cycles in subset and subspace graphs.

    In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general …

    unt Repository record for Hamiltonian cycles in subset and subspace graphs. (opens in a new tab)