Speaker: Dr. S. Arumugam, M.S. University, Tirunelveli, India
Time:    Thursday, September 12th, 1:30 p.m.
Place:   HP4369, Carleton University
Title:   The Asteroidal Chromatic Number of a Graph

Abstract:  An asteroidal set in a graph is a subset $S$ of $V$ such that
given any triple of vertices,  there exists a path from any two vertices
avoiding the neighborhood of the third.  The Asteroidal Chromatic number
$\chi_a$ of a graph $G=(V,E)$ is the minimum order of a partition of $V$
into asteroidal sets.  In this talk we discuss this new graph parameter.