Deletion-only Induced Saturation on Trees
WLH 212 Walter Light Hall, 19 Union St., KingstonXinyue Fan, University of Waterloo Let H be a graph. A graph G is H-induced-saturated if G is H-free – […]
Xinyue Fan, University of Waterloo Let H be a graph. A graph G is H-induced-saturated if G is H-free – […]
Masoomeh Akbari, University of Ottawa The Honeymoon Oberwolfach Problem (HOP), introduced by Šajna, is a recent variant of the classic […]
Prangya Parida, University of Ottawa A binary reflected Gray code (BRGC), denoted by B(n), is an ordering of the 2n […]