Obstructions for linear rankwidth at most 1
Abstract
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.