NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 16
  • 10
  • 9
  • Tagged with
  • 64
  • 23
  • 19
  • 17
  • 9
  • 7
  • 7
  • 6
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 10 of 64 (0.018 seconds)
1

The 1-factorization problem and some related conjectures

Cariolaro, David January 2004 (has links)
No description available.
511.5
2

Generalized operations on hypermaps

Prowse, Anton January 2006 (has links)
No description available.
511.5
3

Betti numbers of graph ideals

Jacques, Sean January 2004 (has links)
No description available.
511.5
4

Critical graphs

Stehlík, Matěj January 2003 (has links)
No description available.
511.5
5

The construction and classification of homogeneous structures in model theory

Jenkinson, Tristan James Brian January 2006 (has links)
No description available.
511.5
6

Automorphism groups of homogeneous structures

Lovell, Stephen Christopher January 2006 (has links)
No description available.
511.5
7

Neighbourhood conditions for factors in graphs

Robertshaw, Andrew Martin January 2000 (has links)
No description available.
511.5
8

Factors in bipartite and other graphs

Poole, Timothy Robert January 2004 (has links)
No description available.
511.5
9

Overlap and fractional graph colouring

Watts, Ivor Llewellyn January 2009 (has links)
Although a considerable body of material exists concerning the colouring of graphs, there is much less on overlap colourings. In this thesis, we investigate the colouring of certain families of graphs.
511.5
10

Random graph processes

Makai, Tamas January 2012 (has links)
This thesis deals with random graph processes. More precisely it deals with two random graph processes which create H -free graphs. The first of these processes is the random H-elimination process which starts from the complete graph and in every step removes an edge uniformly at random from the set of edges which are found in a copy of H. The second is the H-free random graph process which starts from the empty graph and in every step an edge chosen uniformly at random from the set of edges which when added to the graph would not create a copy of H is inserted. We consider these graph processes for several classes of graphs H, for example strictly two balanced graphs. The class of strictly two balanced graphs includes among others cycles and complete graphs. We analysed the H-elimination process, when H is strictly 2-balanced. For this class we show the typical number of edges found at the end of the process. We also consider the sub graphs created by the process and its independence number. We also managed to show the expected number of edges in the H -elimination pro- cess when H = Ki, the graph created from the complete graph on 4 vertices by removing an edge and when H = K34 where K34 is created from the complete bi- partite graph with 3 vertices in one partition and'4 vertices in the second partition, by removing an edge. In case of the H -free process we considered the case when H is the triangle and showed that the triangle-free random graph process only creates sparse subgraphs. Finally we have improved the lower bound on the length of the K34-free random graph process. '
511.5

Page generated in 0.0225 seconds