Obstructions for linear rankwidth at most 1
  We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors. 
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
cs.DM math.CO