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 “"Turnier"”.
-
Close to regular multipartite tournaments
This thesis mainly deals with the existence of directed cycles and directed paths (or short: cycles and paths, respectively) with certain properties in close to regular multipartite tournaments. A multipartite tournament is an orientation of a complete multipartite graph. The statements in this …
-
Local tournaments and in-tournaments
A digraph without loops, multiple arcs and cycles of length two is called a local tournament if the set of in-neighbors as well as the set of out-neighbors of every vertex induces a tournament. In claiming adjacency only for vertices that have a common out-neighbor, this class can be further …
-
Wie man ein 'Weltfest des Pferdesports' erfindet - Das Aachener Spring-, Reit- und Fahrturnier 1924 bis 1939
The ‘Concours Hippique International Officiel’ (CHIO) organised by the Aachen Laurensberger Rennverein (A.L.R.V.) and self-appointed ‘world festival of equestrian sport’ constitutes until today the largest riding and driving event of the world. The key to a story of success has been the ability of …
-
Hamiltonian cycles in certain graphs and out-arc pancyclic vertices in tournaments
In the first part of this thesis, some new sufficient conditions for a graph to be Hamiltonian and some other results on related topics are introduced. Generally speaking, there are two important types of sufficient conditions: the so-called degree conditions and the typical forbidden subgraph …
-
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, …