Now showing items 1-2 of 2

    • Colouring Cayley Graphs 

      Chu, Lei (University of Waterloo, 2005)
      We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will ...
    • Colouring Subspaces 

      Chowdhury, Ameerah (University of Waterloo, 2005)
      This thesis was originally motivated by considering vector space analogues of problems in extremal set theory, but our main results concern colouring a graph that is intimately related to these vector space analogues. ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages