Computer Science – Discrete Mathematics
Scientific paper
2011-06-13
Computer Science
Discrete Mathematics
16 pages, 10 figures
Scientific paper
We provide a characterization of graphs of linear rankwidth at most 1 by
minimal excluded vertex-minors.
Adler Isolde
Farley Arthur M.
Proskurowski Andrzej
No associations
LandOfFree
Obstructions for linear rankwidth at most 1 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Obstructions for linear rankwidth at most 1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Obstructions for linear rankwidth at most 1 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-429996