## Some recent progress and applications in graph minor theory

Venue: | Graphs Combin |

Citations: | 8 - 4 self |

### BibTeX

@ARTICLE{Kawarabayashi_somerecent,

author = {Ken-ichi Kawarabayashi and Bojan Mohar},

title = {Some recent progress and applications in graph minor theory},

journal = {Graphs Combin},

year = {},

volume = {23},

pages = {2007}

}

### OpenURL

### 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. Keywords: Graph minor theory, Tree-width, Tree-decomposition, Path-decomposition, Complete