Skip to Main content Skip to Navigation

Partitionnement, recouvrement et colorabilité dans les graphes

Abstract : Our research are about graph coloring with distance constraints (packing coloring) or neighborhood constraints (Grundy coloring). Let S={si| i in N*} be a non decreasing sequence of integers. An S-packing coloring is a proper coloring such that every set of color i is an si-packing (a set of vertices at pairwise distance greater than si). A graph G is (s1,... ,sk)-colorable if there exists a packing coloring of G with colors 1,... ,k. A Grundy coloring is a proper vertex coloring such that for every vertex of color i, u is adjacent to a vertex of color j, for each ji. These results allow us to determine S-packing coloring of these lattices for several sequences of integers. We examine a class of graph that has never been studied for S-packing coloring: the subcubic graphs. We determine that every subcubic graph is (1,2,2,2,2,2,2)-colorable and (1,1,2,2,3)-colorable. Few results are proven about some subclasses. Finally, we study the Grundy number of regular graphs. We determine a characterization of the cubic graphs with Grundy number 4. Moreover, we prove that every r-regular graph without induced square has Grundy number r+1, for r<5.
Document type :
Complete list of metadatas

Cited literature [90 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, March 27, 2015 - 7:23:07 PM
Last modification on : Friday, July 17, 2020 - 2:54:06 PM
Long-term archiving on: : Thursday, July 2, 2015 - 8:50:30 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01136691, version 1


Nicolas Gastineau. Partitionnement, recouvrement et colorabilité dans les graphes. Mathématique discrète [cs.DM]. Université de Bourgogne, 2014. Français. ⟨NNT : 2014DIJOS014⟩. ⟨tel-01136691⟩



Record views


Files downloads