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....
1. autor: | White, M |
---|---|
Kolejni autorzy: | Scott, A |
Format: | Praca dyplomowa |
Język: | English |
Wydane: |
2011
|
Hasła przedmiotowe: |
Podobne zapisy
-
Colourings of random graphs
od: Heckel, A
Wydane: (2016) -
Graph colourings and games
od: Meeks, KFT
Wydane: (2012) -
Improper colourings of graphs
od: Kang, R
Wydane: (2008) -
Uniform random planar graphs with degree constraints
od: Dowden, C
Wydane: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
od: Peixue Zhao, i wsp.
Wydane: (2023-05-01)