Obstructions for linear rankwidth at most 1

arxiv: 1106.2533 · v1 · pith:7JZXLEHSnew · submitted 2011-06-13 · 💻 cs.DM · math.CO

Isolde Adler , Arthur M. Farley , Andrzej Proskurowski This is my paper

classification 💻 cs.DM math.CO

keywords linearrankwidthcharacterizationexcludedgraphsminimalobstructionsvertex-minors

0 comments

read the original abstract

We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.

This paper has not been read by Pith yet.