Recherche

Session problèmes ouverts. Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php

Phylogenetic networks are directed graphs used to represent evolutionary histories in the presence of events in which several entities may combine to

In order to further develop the theory of packing trees and packing forests in an undirected graph, we extended the notion of supermodular functions

Nous vous invitons à amener des bonnes choses à partager, ainsi que votre tasse, assiette et ustensiles. Ce sera l'occasion de discuter de vie d

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded

Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many

Hadwiger's conjecture, first formulated in 1943, is a vast generalization of the four-color theorem, and remains one of the central open problems in

Exposé en anglais / Talk in english A simple greedy procedure shows that the chromatic number $\chi(G)$ of a graph $G$ is upper bounded by $\Delta(G)

The tree-independence number of a graph is the analogue of treewidth where, instead of minimising the size of bags, we minimise the size of a stable