Sobre a validade da conjectura de reed para os grafos livres de {P5, Flag C}

Abstract

Graphs Theory was established by the studies published by Leonhard Euler in the XVIII century about the problem of the bridge of Königsberg. Over a century, the Londoner Francis Guthrie asked himself whether any political map could be colored with at most four colors which established the Conjecture of the Four Colors. In 1998, Bruce Alan Reed’s proposed another conjecture related to graphs coloring, providing the elaboration of works that provides the truth of his Conjecture for some graphs classes. Considering that some of these works have rather complex arguments, the present work proposes a meticulous study of the work of MedhaDhurandhar,ValidityoftheReedConjectureforgraphs {P5, Flag C}-free,deconstructing the results through simpler proves and arguments in greater detail, in order to facilitate the understanding of this work.