Dalhousie university graphs and games group is a research group with interest fields: Graph Theory, Combinatorics (Hypergraph Theory, Matroids, Simplicial Complexes, Partial Orders) and Combinatorial Games and associated Algorithms and Applications. Techniques applied are from a variety of mathematical fields, including linear and commutative algebra, matrix theory, algebraic topology, analysis and probability. Current active areas of research include: analysis of large scale information networks (e.g. web graph); chromatic and independence polynomials; combinatorial games; combinatorial optimization; frequency planning in cellular networks; independence parameters and coverings of products of graphs; list colourings; network reliability; partial orders; vertextovertex (Searching and Cops & Robber) pursuit games; well covered graphs; and applications of graph theory to music.
Homepage  Jason I. Brown 
Students  Interests: graph polynomials, matchings, Ramsey theory. brown@mathstat.dal.ca 
Courses  
Seminars  Jeannette Janssen 
Events  Interests: list colourings, the WorldWideWeb graph. janssen@mathstat.dal.ca 
Friends  
Richard J. Nowakowski  
Interests: graphs (products, independence, games on), combinatorial
game theory; orders. rjn@mathstat.dal.ca
