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 |
Μορφή: | Thesis |
Γλώσσα: | 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)