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
Distributed decision and verification by mobile ag
Algorithmique distribuée
Tuesday 22 January 2019 - 10h30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Redundancy in Distributed Proofs
Algorithmique distribuée
Tuesday 04 December 2018 - 00h00
Salle : 465 - PCRI-N
Ami Paz .............................................

Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Scalable and exhaustive screening of metabolic fun
Wednesday 28 November 2018 - 11h00
Salle : 465 - PCRI-N
Clémence Frioux .............................................

De la sociologie *avec* des algorithmes à la socio
Friday 09 November 2018 - 14h30
Salle : 445 - PCRI-N
Christpohe Prieur .............................................