Ken-ichiKawarabayashi

Graph Minor project by Robertson and Seymour is perhaps the deepest theory in Graph Theory. It gives a deep structural characterization of graphs without any graph $H$ as a minor. It also gives many exciting algorithmic consequences. In this work, I would like to talk about our attempt to extend Graph minor project to directed …