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....
Prif Awdur: | White, M |
---|---|
Awduron Eraill: | Scott, A |
Fformat: | Traethawd Ymchwil |
Iaith: | English |
Cyhoeddwyd: |
2011
|
Pynciau: |
Eitemau Tebyg
-
Colourings of random graphs
gan: Heckel, A
Cyhoeddwyd: (2016) -
Graph colourings and games
gan: Meeks, KFT
Cyhoeddwyd: (2012) -
Improper colourings of graphs
gan: Kang, R
Cyhoeddwyd: (2008) -
Uniform random planar graphs with degree constraints
gan: Dowden, C
Cyhoeddwyd: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
gan: Peixue Zhao, et al.
Cyhoeddwyd: (2023-05-01)