@article{Ne_et_il_2021,
    doi = {10.1016/j.ejc.2020.103223},
    url = {https://doi.org/10.1016%2Fj.ejc.2020.103223},
    year = {2021},
    month = {jan},
    publisher = {Elsevier {BV}},
    volume = {91},
    pages = {103223},
    author = {Jaroslav Ne{\v{s}}et{\v{r}}il and Patrice Ossona de Mendez and Roman Rabinovich and Sebastian Siebertz},
    title = {Classes of graphs with low complexity: The case of classes with bounded linear rankwidth},
    journal = {European Journal of Combinatorics}
}

@article{Ne_et_il_2021, doi = {10.1016/j.ejc.2020.103223}, url = {https://doi.org/10.1016%2Fj.ejc.2020.103223}, year = {2021}, month = {jan}, publisher = {Elsevier {BV}}, volume = {91}, pages = {103223}, author = {Jaroslav Ne{\v{s}}et{\v{r}}il and Patrice Ossona de Mendez and Roman Rabinovich and Sebastian Siebertz}, title = {Classes of graphs with low complexity: The case of classes with bounded linear rankwidth}, journal = {European Journal of Combinatorics} }