∼Andre Raspaud教授演講摘要∼
| 日期 |
星期 |
時間 |
演講者 |
單位 |
演講地點 |
演講題目 |
| 94.01.12 |
三 |
16:10-17:00 |
Andre Raspaud |
Universite Bordeaux |
理4013 |
Oriented coloring |
摘要
We present the notion of oriented coloring. The oriented
chromatic number is defined as the minimum number necessary to
color any orientation G* of an undirected graph G, such that
no two neighbors in G* are assigned the same color, and such
that if two colors c(u) and c(v) are respectively assigned to
vertices u and v satisfying (u,v)
Î
A(G*), then for any
(z,t)
Î
A(G*), we cannot have simultaneously c(z)=c(v) and
c(t)=c(u). We will prove that any planar graphs has an oriented
chromatic number at most 80. We will also present known results
and open problems.
