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....
Hoofdauteur: | White, M |
---|---|
Andere auteurs: | Scott, A |
Formaat: | Thesis |
Taal: | English |
Gepubliceerd in: |
2011
|
Onderwerpen: |
Gelijkaardige items
-
Colourings of random graphs
door: Heckel, A
Gepubliceerd in: (2016) -
Graph colourings and games
door: Meeks, KFT
Gepubliceerd in: (2012) -
Improper colourings of graphs
door: Kang, R
Gepubliceerd in: (2008) -
Uniform random planar graphs with degree constraints
door: Dowden, C
Gepubliceerd in: (2008) -
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
door: Peixue Zhao, et al.
Gepubliceerd in: (2023-05-01)