# Three years of graphs and music : some results in graph theory and its applications

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This thesis consists in successive glimpses of different problems in discrete mathematics related to graph theory. Its mains focus is on graph colouring, i.e. on assignments of integer values to the vertices (or edges) of a graph satisfying a set of local constraints, most of the time the exclusion of specific patterns in the coloured graph. For several different types of colouring (vertex and edge choosability, acyclic or linear colouring, ...) a state of the art is provided, along with results ensuring the existence of such colourings on planar graphs or subclasses of them -- with the aim of minimising the number of colours used for a given Maximum Degree, or Maximum Average Degree. This thesis also deals with decompositions of graphs into induced subgraphs, and asserts that similarly to what Wilson's theorem implies for non-induced graph decomposition, there exists for any graph $H$ an infinite sequence of dense graph whose edge set can be partitioned in induced copies of $H$. The proof methodology involves hypergraphs, for which a decomposition result is presented, i.e. that the complete 3-uniform hypergraph can be partitioned into $\lceil \frac {n(n-1)} 6\rceil$ $\alpha$-acyclic hypergraphs as conjectured. In a third part are gathered algorithmic questions. Those are problems of optimisation or existence motivated by telecommunications in networks, studied with the classical framework of computational complexity, or the search of subgraphs through parametrised complexity. In a fourth part it, considers counting problems belonging to the study of chemical graphs, and finally details some Integer LinearPrograms used in the Mathematics software Sage.
Keywords :
Document type :
Theses

https://tel.archives-ouvertes.fr/tel-00645151
Contributor : Nathann Cohen Connect in order to contact the contributor
Submitted on : Saturday, November 26, 2011 - 7:21:00 PM
Last modification on : Thursday, August 4, 2022 - 4:52:43 PM
Long-term archiving on: : Friday, November 16, 2012 - 12:06:16 PM

### Identifiers

• HAL Id : tel-00645151, version 1

### Citation

Nathann Cohen. Three years of graphs and music : some results in graph theory and its applications. Discrete Mathematics [cs.DM]. Université Nice Sophia Antipolis, 2011. English. ⟨tel-00645151⟩

Record views