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 6 of 6 for “"Ordered graphs"”.
-
Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree
Graphs can effectively model biomolecules, computer systems, and other applications. A weighted graph is a graph in which values or labels are assigned to the edges of the graph. However, in this thesis, we assign values to the vertices of the graph rather than the edges and we modify several …
-
Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures
… the List $r$-Coloring Problem restricted to hypergraphs and ordered graphs with forbidden substructures. In the context of forbidding non-induced substructure in hypergraphs, we obtain complete complexity dichotomies of the $r$-Coloring Problem and the $r$-Pre-Coloring Extension Problem in …
-
Topics in finite graph Ramsey theory
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to …
-
Ramsey theory: The Erdős-Gyárfás problem and ordered size Ramsey questions
DSpace SAF Submission Ingestion Package generated from Vireo submission #16387 on 2021-09-16 at 16:42:26
-
Discrete Models and Algorithms for Analyzing DNA Rearrangements
… recombination models are proposed. Edges in an ordered graph model the relative positions of precursor DNA segments and their labels indicate the orientations and destinations in the product genome. Properties of these structures are introduced with the intention to narrow down the space of …
-
Extremal and probabilistic problems for discrete structures
… is the study of Dirac-type problems for (vertex) ordered graphs. For any fixed ordered graph H, we determine the asymptotic minimum degree threshold for forcing (i) a perfect H-tiling in an ordered graph, under the assumption that χ<(H) ≥ 3; (ii) an H-tiling in an ordered graph G covering a fixed …