Obstructions for linear rankwidth at most 1
Discrete Mathematics
2011-06-14 v1 Combinatorics
Abstract
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.
Keywords
Cite
@article{arxiv.1106.2533,
title = {Obstructions for linear rankwidth at most 1},
author = {Isolde Adler and Arthur M. Farley and Andrzej Proskurowski},
journal= {arXiv preprint arXiv:1106.2533},
year = {2011}
}
Comments
16 pages, 10 figures