NDLTD logo NDLTD Union Catalog and Global ETD Search

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 “"Hamilton cycles"”.

  1. Embedding problems in graphs and hypergraphs

    Treglown, Andrew ClarkUniversity of Birmingham2011

    … The second part of the thesis concerns Hamilton cycles in directed graphs. We give a condition on the degree sequences of a digraph \(G\) that ensures \(G\) is Hamiltonian. This gives an approximate solution to a problem of Nash-Williams concerning a digraph analogue of Chvatal's …

    birmingham Repository record

  2. Eindeutige Faktoren von Graphen - maximale Kantenzahlen und Extremalgraphen

    Johann, PetraPublikationsserver der RWTH Aachen University2000

    … graphs with unique k-factors, graphs with unique Hamilton cycles or Hamilton paths, and graphs with a unique subgraph on a given (small and fixed) number of edges.

    aachen Repository record

  3. Extremal Problems for Cycles, Paths and Set-Systems

    Mond, AdvaUniversity of Cambridge2024

    … we consider extremal questions regarding cycles. Cycles in graphs are one of the most natural and basic structures to study. In particular, in the context of extremal problems, questions regarding their appearance and their count has always been of a significant interest. In Chapter 2 we …

    cambridge Repository record

  4. A set of tournaments with many Hamiltonian cycles

    Ushijima-mwesigwa, Hayato

    clemson Repository record