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 11 of 11 for “"Hamiltonian cycles"”.
-
Finding Hamiltonian Cycles
<p>Finding a Hamiltonian cycle in a graph is used for solving major problems in areas such as graph theory, computer networks, and algorithm design. In this thesis various approaches of Hamiltonian cycle algorithms such as backtrack algorithms and heuristic algorithms, their basic ideas, and their …
-
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 …
-
Hamiltonian cycles in maximal planar graphs and planar triangulations
… minimum degree i. Chapter 4 will be devoted to Hamiltonian cycles in maximal planar graphs. We discuss the existence of Hamiltonian cycles in maximal planar graphs. Whitney proved that any maximal planar graph without a separating triangle is Hamiltonian, where a separating triangle is a …
-
Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-07-10T16:04:32Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 thesis.pdf: 580482 bytes, checksum: 33853047e47046b466c6e010e8cbbd38 (MD5) Zamani Nasab_Reza.pdf: 580482 bytes, checksum: …
-
Prime And Irreducible Elements In Z<sub>x</sub> , Hamiltonian Cycles In Concentric Circle Graphs, And Fibonacci Sequences In Z<sub>x</sub>
… polynomial time algorithms for determining Hamiltonian cycles in certain types of concentric circle graphs. In the third part, we discuss the Fibonacci sequence in Z<sub>x</sub>. All of the theorems stated in our thesis are new to us.
-
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 …
-
Geometric and Algebraic Graphs and their Applications
… problem in pure graph theory involves finding Hamiltonian cycles in a power set on n elements. We take advantage of the fact that it is an algebraic graph to produce a method of finding large cycles in the graph. Finally we investigate a method of finding Super Edge-graceful labeling (SEGL) on …
-
Fault-tolerance embedding of rings and arrays in star and pancake graphs
… In this thesis, we present methods to embed Hamiltonian paths (H-path) and Hamiltonian cycles (H-cycle) in a star graph {dollar}S\sb{n}{dollar} and pancake graph {dollar}P\sb{n}{dollar} in a faulty environment. Such embeddings are important for solving computational problems, formulated for …
-
Preferences in answer set programming
… and graph-theoretical problems, e.g. finding Hamiltonian cycles. On different lines of ASP research, many extensions of the basic formalism have been proposed. The most intensively studied one is the modelling of preferences in ASP. They constitute a natural and effective way of selecting …
-
Extremal properties of some random combinatorial systems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms