Now showing items 1-2 of 2

  • An Exploration of Orthogonal Colourings 

    MacKeigan, Kyle (2021-09-01)
    Two colourings of a graph are orthogonal if when two elements are coloured with the same colour in one of the colourings, then those elements receive distinct colours in the other colouring. First, we study the orthogonal ...
  • An Investigation on Graph Polynomials 

    Erey, Aysel
    The chromatic polynomial of a graph 𝐺, denoted π (𝐺, 𝑥), is the polynomial whose evaluations at positive integers 𝑥 count the number of (proper) 𝑥-colourings of 𝐺. This polynomial was introduced by Birkhoff in 1912 ...