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....
Auteur principal: | White, M |
---|---|
Autres auteurs: | Scott, A |
Format: | Thèse |
Langue: | English |
Publié: |
2011
|
Sujets: |
Documents similaires
-
Colourings of random graphs
par: Heckel, A
Publié: (2016) -
Graph colourings and games
par: Meeks, KFT
Publié: (2012) -
Improper colourings of graphs
par: Kang, R
Publié: (2008) -
Uniform random planar graphs with degree constraints
par: Dowden, C
Publié: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
par: Peixue Zhao, et autres
Publié: (2023-05-01)