Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k

Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum. Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. In Petra Berenbrink, Benjamin Monmege, editors, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Volume 219 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{Kante0KO22,
  title = {Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k},
  author = {Mamadou Moustapha Kanté and Eun Jung Kim 0002 and O-joung Kwon and Sang-il Oum},
  year = {2022},
  doi = {10.4230/LIPIcs.STACS.2022.40},
  url = {https://doi.org/10.4230/LIPIcs.STACS.2022.40},
  researchr = {https://researchr.org/publication/Kante0KO22},
  cites = {0},
  citedby = {0},
  booktitle = {39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
  editor = {Petra Berenbrink and Benjamin Monmege},
  volume = {219},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-222-8},
}