56 citations · 715 across the 68 of their papers we have counts for
4 papers · 1 filter
Burling graphs revisited, part III: Applications to -boundedness
Pegah Pournajafi, Nicolas Trotignon
The Burling sequence is a sequence of triangle-free graphs of unbounded chromatic number. The class of Burling graphs consists of all the induced subgraphs of the graphs of this se…
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…
Burling graphs revisited, part II: Structure
Pegah Pournajafi, Nicolas Trotignon
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling gr…
Burling graphs revisited, part I: New characterizations
Pegah Pournajafi, Nicolas Trotignon
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Each of them is isomorphic to the intersection graph of a set of axis-parallel boxes in $…