Burling graphs revisited Part 2: Structure

Abstract

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 graph. These graphs have attracted some attention because they have geometric representations and because they provide counter-examples to several conjectures about bounding the chromatic number in classes of graphs. We recall an equivalent definition of Burling graphs from the first part of this work: the graphs derived from a tree. We then give several structural properties of derived graphs.