collaborators

1 paper

cs.DM2011

Obstructions for linear rankwidth at most 1

Isolde Adler, Arthur M. Farley, Andrzej Proskurowski

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