Obstructions for linear rankwidth at most 1
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.
cs.DM↗
arXiv subjects
Publications and source records attributed to Arthur M. Farley.
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.