Classes of graphs with low complexity: The case of classes with bounded linear rankwidth

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Jaroslav Nešetřil, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Journal title: European Journal of Combinatorics

Journal number: 91

Journal publisher: Academic Press

Published year: 2021

Published pages: 103223

DOI identifier: 10.1016/j.ejc.2020.103223

ISSN: 0195-6698