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)