Title    name KAIST Graph Theory Day 2011     Title On the chromatic number of digraphs   Speaker Bojan Mohar (Simon Fraser University)   Date 2011-05-10   Host   Place KAIST   File     Abstract : Several reasons will be presented why the natural extension of the notion of undirected graph colorings is to partition the vertex set of a digraph into acyclic sets. Additionally, some recent results in this area, the proofs of which use probabilistic techniques, will be outlined.

Information Center for Mathematical Sciences KAIST 335 Gwahangno (373-1 Guseong-dong), Yuseong-gu, Daejeon 305-701, Republic of Korea TEL +82-42-869-8195~6, FAX +82-42-869-5722, e-mail : mathnet@mathnet.or.kr Copyright (c) 2009 by ICMS. All Rights Reserved