Colloquium Announcement
Department of Mathematics
West Virginia University
for
Thursday, April 22, 1999, at 3:45pm
in 315 Armstrong Hall
(Tea and cookies begin at 3:00 in coffee room.)
Professor Hao Li
French National Scientifique Research Center (C.N.R.S.),
France
On the vertex-distinguishing proper edge-colorings of graphs
Abstract
We prove the conjecture of Burris and Schelp:
the minimum number of colors required to color the edges of
a graph of order n such that a vertex is not incident with
two edges with the same color and any two vertices are incident
with difent sets
of colors is at most n+1.
The information on the future (and past) Colloquia can be also found on web at the
address:
http://www.math.wvu.edu/homepages/kcies/colloquium.html