5 citations · 8 across the 9 of their papers we have counts for
4 papers · 1 filter
Product structure of graph classes with bounded treewidth
Rutger Campbell, Katie Clinch, Marc Distel +8
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end…
On Comparable Box Dimension
Zdenek Dvorák, Daniel Goncalves, Abhiruk Lahiri +2
Two boxes in are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph is the minimum integer such…
Induced subgraphs of induced subgraphs of large chromatic number
António Girão, Freddie Illingworth, Emil Powierski +4
We prove that, for every graph with at least one edge, there is a constant such that there are graphs of arbitrarily large chromatic number and the same clique number as…
Decomposing random permutations into order-isomorphic subpermutations
Carla Groenland, Tom Johnston, Dániel Korándi +3
Two permutations and are -similar if they can be decomposed into subpermutations and such that is order-isomorphic to f…