Skip to Main content Skip to Navigation

Global discharging methods for coloring problems in graphs

Marthe Bonamy 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This thesis falls within graph theory, and deals more precisely with graph coloring problems. In this thesis, we use and develop the discharging method, a counting argument that makes strong advantage of the graph structure. This method is decisive in the proof of the Four Color Theorem. We first give an illustrated overview of the discharging tools that are used for this work: nice methods that we apply, and handy tricks that we develop. In particular, we present the main ideas in a global discharging argument. In the realm of list edge coloring, we most notably prove that the weak List Coloring Conjecture is true for planar graphs of maximum degree 8 (i.e. that they are edge 9-choosable), thus improving over a result of Borodin from 1990. We finally present our results about square coloring, where the goal is to color the vertices in such a way that two vertices that are adjacent or have a common neighbor receive different colors. We look in particular into sufficient conditions on the density of a graph (i.e. the maximum average degree of a subgraph) for its square to be colorable with few colors.
Complete list of metadatas

Cited literature [109 references]  Display  Hide  Download
Contributor : Marthe Bonamy <>
Submitted on : Friday, March 29, 2019 - 10:34:19 AM
Last modification on : Thursday, March 5, 2020 - 3:31:46 PM
Long-term archiving on: : Sunday, June 30, 2019 - 1:28:05 PM


Files produced by the author(s)


  • HAL Id : tel-02083632, version 1



Marthe Bonamy. Global discharging methods for coloring problems in graphs. Discrete Mathematics [cs.DM]. Université de Montpellier, 2015. English. ⟨tel-02083632⟩



Record views


Files downloads