Recherche
Consider a graph G with a path P of order n. What conditions force G to also have a long induced path? In this talk, we will propose a new way to
Soutenance de thèse / PhD. Defense [Timothée Corsini] (LaBRI) Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https:/
N/A Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres
Phylogenetic networks are directed graphs used to represent evolutionary histories in the presence of events in which several entities may combine to
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that
Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many
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)
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture
In computational biology, phylogenetics is the study of evolutionary histories, their reconstruction from data, their comparison, and interaction
In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph