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....
Hlavní autor: | White, M |
---|---|
Další autoři: | Scott, A |
Médium: | Diplomová práce |
Jazyk: | English |
Vydáno: |
2011
|
Témata: |
Podobné jednotky
-
Colourings of random graphs
Autor: Heckel, A
Vydáno: (2016) -
Graph colourings and games
Autor: Meeks, KFT
Vydáno: (2012) -
Improper colourings of graphs
Autor: Kang, R
Vydáno: (2008) -
Uniform random planar graphs with degree constraints
Autor: Dowden, C
Vydáno: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
Autor: Peixue Zhao, a další
Vydáno: (2023-05-01)