Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s)
On the chromatic number of digraphs
Ararat Harutyunyan

01 June 2012, 10h30 - 01 June 2012, 11h30
Salle/Bat : 455/PCRI-N
Contact :

Activités de recherche :

Résumé :
We will review some results which provide evidence that partitioning the vertex set of a digraph into the smallest number of acyclic sets is the natural extension of the notion of the chromatic number of (undirected) graphs. We will also present some recently obtained results in this area. In particular, we will show analogs of Brooks' Theorem and Gallai's Theorem for digraphs, and explore the complexity of some algorithmic problems.
Then we will discuss some extremal results as well as problems on planar digraphs.

(This is joint work with Bojan Mohar.)

Pour en savoir plus :
Séminaires
A Two-level Auction for Resource Allocation in Mul
Réseaux sans fil et mobiles
Friday 09 March 2018 - 14h30
Salle : 445 - PCRI-N
Mira Morcos .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 09 February 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Approximate Bayesian Computation and Random Forest
Thursday 08 February 2018 - 00h00
Salle : 455 - PCRI-N
Valentin Thouzeau .............................................

A concurrent lock-free algorithm for computing a f
Combinatoire
Friday 12 January 2018 - 14h30
Salle : 445 - PCRI-N
James Mitchell .............................................

Acyclic Partitioning of Large Directed Acyclic Gra
Calcul à haute performance
Tuesday 09 January 2018 - 10h30
Salle : 465 - PCRI-N
Julien Herrmann .............................................