Andrzej Proskurowski: More graph width parameters and minors: linear rankwidth and vertex minors
Time: Thu 2014-03-27 15.30 - 16.30
Location: Institut Mittag-Leffler, Auravägen 17, Djursholm
Participating: Andrzej Proskurowski, University of Oregon
We establish the set of minimal forbidden induced subgraphs for the class of graphs having linear rank-width at most 1. From these we derive both the vertex-minor and pivot-minor obstructions for the class. We conclude with a linear-time recognition of the graphs in the class.