“…A key property is that layered treewidth is bounded on planar graphs but treewidth is not. In particular, planar graphs have layered treewidth at most 3 [27], but the n×n grid graph has treewidth n. Layered treewidth has been used in upper bounds on several graph parameters including queue-number [25,27], stack number [25], boxicity [69], clustered chromatic number [50], generalised colouring numbers [73], asymptotic dimension [8,48], as well for results in intersection graph theory [71]. Row treewidth 7 is a reőnement of layered treewidth, implicitly introduced by Dujmović, Joret, Micek, Morin, Ueckerdt, and Wood [26], who proved that planar graphs have row treewidth at most 8.…”