Skip to Main content Skip to Navigation
New interface
Habilitation à diriger des recherches

Some problems in graph theory and graphs algorithmic theory

Stéphane Bessy 1 
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This document is a long abstract of my research work, concerning graph theory and algorithms on graphs. It summarizes some results, gives ideas of the proof for some of them and presents the context of the different topics together with some interesting open questions connected to them The first part precises the notations used in the rest of the paper; the second part deals with some problems on cycles in digraphs; the third part is an overview of two graph coloring problems and one problem on structures in colored graphs; finally the fourth part focus on some results in algorithmic graph theory, mainly in parametrized complexity.
Document type :
Habilitation à diriger des recherches
Complete list of metadata

https://theses.hal.science/tel-00806716
Contributor : Stéphane Bessy Connect in order to contact the contributor
Submitted on : Tuesday, April 2, 2013 - 11:17:16 AM
Last modification on : Thursday, October 13, 2022 - 8:20:28 AM
Long-term archiving on: : Wednesday, July 3, 2013 - 4:05:16 AM

File

Identifiers

  • HAL Id : tel-00806716, version 1

Collections

Citation

Stéphane Bessy. Some problems in graph theory and graphs algorithmic theory. Discrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012. ⟨tel-00806716⟩

Share

Metrics

Record views

347

Files downloads

4604