MASCOTTE no longer exists => visit the new project-team
Seminaire MASCOTTEOn the chromatic number of digraphs par Ararat Harutyunyan (Simon Fraser University, Vancouver, Canada)
Date : | 22/05/12 | Time : | 10:30 | Location : | Galois Coriolis |
Ă‚' We will review some results which provide evidence that partitioning the vertex set of a digraph into the smallest number of acyclic sets is a 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.
Page des séminaires
|