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)