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....
Autor principal: | White, M |
---|---|
Altres autors: | Scott, A |
Format: | Thesis |
Idioma: | English |
Publicat: |
2011
|
Matèries: |
Ítems similars
-
Colourings of random graphs
per: Heckel, A
Publicat: (2016) -
Graph colourings and games
per: Meeks, KFT
Publicat: (2012) -
Improper colourings of graphs
per: Kang, R
Publicat: (2008) -
Uniform random planar graphs with degree constraints
per: Dowden, C
Publicat: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
per: Peixue Zhao, et al.
Publicat: (2023-05-01)