Some recent progress and applications in graph minor theory
K Kawarabayashi, B Mohar - Graphs and combinatorics, 2007 - Springer
Graphs and combinatorics, 2007•Springer
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful
theorem capturing the``rough''structure of graphs excluding a fixed minor. This result was
used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the
graph minor relation. Recently, a number of beautiful results that use this structural result
have appeared. Some of these along with some other recent advances on graph minors are
surveyed.
theorem capturing the``rough''structure of graphs excluding a fixed minor. This result was
used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the
graph minor relation. Recently, a number of beautiful results that use this structural result
have appeared. Some of these along with some other recent advances on graph minors are
surveyed.
Abstract
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough'' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed.
Springer
