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)