Burling graphs revisited, part II: Structure - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2024

Burling graphs revisited, part II: Structure

Résumé

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.

Dates et versions

hal-04253853 , version 1 (23-10-2023)

Identifiants

Citer

Pegah Pournajafi, Nicolas Trotignon. Burling graphs revisited, part II: Structure. European Journal of Combinatorics, 2024, 116, pp.103849. ⟨10.1016/j.ejc.2023.103849.⟩. ⟨hal-04253853⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More