5 citations · 8 across the 9 of their papers we have counts for
11 papers
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…
Graph Pseudometrics from a Topological Point of View
Ana Lucia Garcia-Pulido, Kathryn Hess, Jane Tan +3
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful…
Counting partitions of with degree congruence conditions
Paul Balister, Emil Powierski, Alex Scott +1
For , the Erdős--Renyi random graph, let be the random variable representing the number of distinct partitions of into sets so that th…
Reconstruction from smaller cards
Carla Groenland, Tom Johnston, Alex Scott +1
The -deck of a graph is the multiset of all induced subgraphs of on vertices. We say that a graph is reconstructible from its -deck if no other graph has…
Reconstructing the degree sequence of a sparse graph from a partial deck
Carla Groenland, Tom Johnston, Andrey Kupavskii +3
The deck of a graph is the multiset of cards . Myrvold (1992) showed that the degree sequence of a graph on vertices can be reconstructed from any d…
A note on infinite antichain density
Paul Balister, Emil Powierski, Alex Scott +1
Let be an antichain of finite subsets of . How quickly can the quantities grow as ? We show that for any sequence…
Eulerian circuits and path decompositions in quartic planar graphs
Jane Tan
A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuit…
Small 4-regular planar graphs that are not circle representable
Jane Tan
A 4-regular planar graph is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to…