Graphs with no triangle and no F are 8-colourable (original) (raw)

Graphs with no triangle and no F are 8-colourable

Abstract

Let F be the tree we obtain from the claw (K1,3) by subdividing two of its three branches once, and twice, respectively. We show that every graph with no triangle and no induced F is 8-colourable.

Nicolas Trotignon hasn't uploaded this paper.

Let Nicolas know you want this paper to be uploaded.

Ask for this paper to be uploaded.