3 citations · 3 across the 3 of their papers we have counts for
1 paper · 2 filters
Curtis Greene, Samira Sahar Jamil
We define a d-cube in a graph G to be monophobic in G if, whenever it supports a d-face of a discrete singular d+1-cube, it must also support another face. In many cases,…