Xinyue Fan, University of Waterloo Let H be a graph. A graph G is H-induced-saturated if G is H-free – meaning that no induced subgraph of G is isomorphic to […]

Masoomeh Akbari, University of Ottawa The Honeymoon Oberwolfach Problem (HOP), introduced by Šajna, is a recent variant of the classic Oberwolfach Problem. This problem asks whether it is possible to […]

Prangya Parida, University of Ottawa A binary reflected Gray code (BRGC), denoted by B(n), is an ordering of the 2n binary n-tuples such that any two consecutive tuples differ in […]