Classes of graphs with small rank decompositions are χ-bounded by Dvořák, Král’

https://www.doi.org/https://doi.org/10.1016/j.ejc.2011.12.005

@article{rankwidthChibounded2012,
author = {Zdeněk Dvořák and Daniel Král’},
doi = {https://doi.org/10.1016/j.ejc.2011.12.005},
issn = {0195-6698},
journaltitle = {European Journal of Combinatorics},
number = {4},
pages = {679--683},
title = {Classes of graphs with small rank decompositions are χ-bounded},
volume = {33},
year = {2012},
}

page 2 : rank-width upper bounds chi-bounded by a constant – Theorem 1. For any $k$, the class of graphs with rank-width at most $k$ is $\chi$-bounded.