Skip to Main content Skip to Navigation

Coloring, stable set and structure of graphs

Abstract : This thesis deals with graph coloring, list-coloring, maximum weightstable set (shortened as MWSS) and structural graph theory.First, we provide polynomial-time algorithms for the 4-coloring problem insubclasses of P6-free graphs. These algorithms rely on a preciseunderstanding of the structure of these classes of graphs for which we give afull description.Secondly, we study the list-coloring conjecture and prove that for anyclaw-free perfect graph with clique number bounded by 4, the chromatic numberand the choice number are equal. This result is obtained by using adecomposition theorem for claw-free perfect graphs, a structural description ofthe basic graphs of this decomposition and by using Galvin's famous theorem.Next by using the structural description given in the first chapter andstrengthening other aspects of this structure, we provide polynomial-timealgorithms for the MWSS problem in subclasses of P6-free and P7-freegraphs.In the last chapter of the manuscript, we disprove a conjecture of De Simoneand K"orner made in 1999 related to normal graphs. Our proof is probabilisticand is obtained by the use of random graphs.
Document type :
Complete list of metadatas

Cited literature [115 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, September 7, 2018 - 4:30:06 PM
Last modification on : Friday, October 23, 2020 - 4:57:52 PM
Long-term archiving on: : Saturday, December 8, 2018 - 3:57:07 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01870476, version 1



Lucas Pastor. Coloring, stable set and structure of graphs. Discrete Mathematics [cs.DM]. Université Grenoble Alpes, 2017. English. ⟨NNT : 2017GREAM071⟩. ⟨tel-01870476⟩



Record views


Files downloads