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....
Автор: | White, M |
---|---|
Інші автори: | Scott, A |
Формат: | Дисертація |
Мова: | English |
Опубліковано: |
2011
|
Предмети: |
Схожі ресурси
Схожі ресурси
-
Colourings of random graphs
за авторством: Heckel, A
Опубліковано: (2016) -
Graph colourings and games
за авторством: Meeks, KFT
Опубліковано: (2012) -
Improper colourings of graphs
за авторством: Kang, R
Опубліковано: (2008) -
Uniform random planar graphs with degree constraints
за авторством: Dowden, C
Опубліковано: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
за авторством: Peixue Zhao, та інші
Опубліковано: (2023-05-01)