12 citations · 26 across the 4 of their papers we have counts for
5 papers
When all holes have the same length
Jake Horsfield, Myriam Preissmann, Cléophée Robin +3
For every integer , we give a structural description of the class of graphs whose chordless cycles of length at least 4 all have length .
Graphs with all holes the same length
Linda Cook, Jake Horsfield, Myriam Preissmann +5
A graph is "-holed" if all its induced cycles of length at least four have length exactly . We give a complete description of the -holed graphs for each $\ell\ge…
List -Colouring -Free Graphs: a Mim-width Perspective
Nick Brettell, Jake Horsfield, Andrea Munaro +1
A colouring of a graph is a mapping such that for every two adjacent vertices and of . The {\sc List -Colourin…
Colouring -Free Graphs: a Mim-Width Perspective
Nick Brettell, Jake Horsfield, Daniel Paulusma
We prove that the class of -free graphs has bounded mim-width for every and , and that there is a polynomial-time algorithm that, given a graph i…
Bounding the Mim-Width of Hereditary Graph Classes
Nick Brettell, Jake Horsfield, Andrea Munaro +2
A large number of NP-hard graph problems become polynomial-time solvable on graph classes where the mim-width is bounded and quickly computable. Hence, when solving such problems o…