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 4 of 4 for “"ordered graphs"”.
-
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, …
-
Inducibility and Subgraph Density Problems in Graphs
… in a variety of settings, including edge-colored graphs, edge-weighted graphs, oriented graphs, and ordered graphs. In some of these settings, we consider the number of (not necessarily induced) subgraphs of G that are isomorphic to F, while in others we only consider the induced subgraphs of G.
-
Average-case complexity of detecting cliques
… of gates, and the input distributions are random graphs with an appropriate density of edges. Such random graphs (the well-studied Erdos-Renyi random graphs) are widely believed to be a source of computationally hard instances for clique problems (as Karp suggested in 1976). Our results are the …
-
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