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 5 of 5 for “"games on graphs"”.
-
Games on Graphs and Other Combinatorial Problems
In this dissertation, we consider various combinatorial problems. The four chapters after the Introduction concern games on graphs, while latter on, we make progress on some questions in the settings of Rademacher sums and graph theory. In Chapter 2, we study the $(m,b)$ Maker-Breaker percolation …
-
Games on graphs, visibility representations, and graph colorings
"In this thesis we study combinatorial games on graphs and some graph parameters whose consideration was inspired by an interest in the symmetry of hypercubes. A capacity function f on a graph G assigns a nonnegative integer to each vertex of V(G). An f-matching in G is a set M ⊆ E(G) such that the …
-
Complexity in Infinite Games on Graphs and Temporal Constraint Networks
This dissertation deals with a number of algorithmic problems motivated by automated temporal planning and formal verification of reactive and finite state systems. Particularly, we shall focus on game theoretical methods in order to obtain improved complexity bounds and faster algorithms for the …
-
Degree Ramsey theory, game and Roman domination, and game saturation in graphs
… graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding such hosts for trees and cycles. In Chapter 3 we consider the ""on-line"" version of this problem. We model this …
-
Peg Solitaire on Trees with Diameter Four
<p>In a paper by Beeler and Hoilman, the traditional game of peg solitaire is generalized to graphs in the combinatorial sense. One of the important open problems in this paper was to classify solvable trees. In this thesis, we will give necessary and sufficient conditions for the solvability for …