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....
Príomhchruthaitheoir: | White, M |
---|---|
Rannpháirtithe: | Scott, A |
Formáid: | Tráchtas |
Teanga: | English |
Foilsithe / Cruthaithe: |
2011
|
Ábhair: |
Míreanna comhchosúla
Míreanna comhchosúla
-
Colourings of random graphs
de réir: Heckel, A
Foilsithe / Cruthaithe: (2016) -
Graph colourings and games
de réir: Meeks, KFT
Foilsithe / Cruthaithe: (2012) -
Improper colourings of graphs
de réir: Kang, R
Foilsithe / Cruthaithe: (2008) -
Uniform random planar graphs with degree constraints
de réir: Dowden, C
Foilsithe / Cruthaithe: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
de réir: Peixue Zhao, et al.
Foilsithe / Cruthaithe: (2023-05-01)