Structural and algorithmic aspects of partial orderings of graphs

Jean-Florent Raymond 1, 2
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The central theme of this thesis is the study of the properties of the classes of graphs defined by forbidden substructures and their applications. The first direction that we follow concerns well-quasi-orders. Using decomposition theorems on graph classes forbidding one substructure, we identify those that are well-quasi-ordered. The orders and substructures that we consider are those related to the notions of contraction and induced minor. Then, still considering classes of graphs defined by forbidden substructures, we obtain bounds on invariants such as degree, treewidth, tree-cut width, and a new invariant generalizing the girth. The third direction is the study of the links between the combinatorial invariants related to problems of packing and covering of graphs. In this direction, we establish new connections between these invariants for some classes of graphs. We also present algorithmic applications of the results.
Liste complète des métadonnées
Contributor : Jean-Florent Raymond <>
Submitted on : Friday, March 10, 2017 - 1:43:31 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM
Document(s) archivé(s) le : Sunday, June 11, 2017 - 3:04:47 PM


  • HAL Id : tel-01486769, version 1



Jean-Florent Raymond. Structural and algorithmic aspects of partial orderings of graphs. Discrete Mathematics [cs.DM]. Université de Montpellier; University of Warsaw, 2016. English. ⟨tel-01486769⟩



Record views


Files downloads