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 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
The celebrated Linear Arboricity Conjecture of Akiyama, Exoo, and Harary from 1980 asserts that the edges of every graph with maximum degree Δ can be
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