Cycles in edge-coloured graphs and subgraphs of random graphs
<p>This thesis will study a variety of problems in graph theory. Initially, the focus will be on finding minimal degree conditions which guarantee the existence of various subgraphs. These subgraphs will all be formed of cycles, and this area of work will fall broadly into two main categories....
Main Author: | White, M |
---|---|
Other Authors: | Scott, A |
Format: | Thesis |
Language: | English |
Published: |
2011
|
Subjects: |
Similar Items
-
Colourings of random graphs
by: Heckel, A
Published: (2016) -
Uniform random planar graphs with degree constraints
by: Dowden, C
Published: (2008) -
Graph colourings and games
by: Meeks, KFT
Published: (2012) -
Trees and graphs: congestion, polynomials and reconstruction
by: Law, H
Published: (2011) -
Connectivity and related properties for graph classes
by: Weller, K, et al.
Published: (2014)