1 paper · 1 filter
Fayzan Khan
A graph G is uniquely C_t-saturated if G contains no cycle of length t and, for every edge e of the complement, G+e contains exactly one cycle of length t; it is nontrivial if it h…