Obstructions for linear rankwidth at most 1

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 10 figures

Scientific paper

We provide a characterization of graphs of linear rankwidth at most 1 by
minimal excluded vertex-minors.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-429996

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.