The rank-width of the square grid Original Research Article

Rank-width is a graph width parameter introduced by Oum and Seymour. It is known that a class of graphs has bounded rank-width if, and only if, it has bounded clique-width, and that the rank-width of image is less than or equal to its branch-width.