Abstract
We establish the set of minimal forbidden induced subgraphs for the class of graphs having linear rank-width at most 1. From these we derive both the vertex-minor and pivot-minor obstructions for the class.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
