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 |
---|---|
Outros autores: | Scott, A |
Formato: | Thesis |
Idioma: | English |
Publicado: |
2011
|
Subjects: |
Títulos similares
-
Colourings of random graphs
por: Heckel, A
Publicado: (2016) -
Graph colourings and games
por: Meeks, KFT
Publicado: (2012) -
Improper colourings of graphs
por: Kang, R
Publicado: (2008) -
Uniform random planar graphs with degree constraints
por: Dowden, C
Publicado: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
por: Peixue Zhao, et al.
Publicado: (2023-05-01)