1 paper
Yuying Li, Kexiang Xu, Dániel Gerbner +1
A graph G is uniquely H-saturated if it contains no copy of a graph H as a subgraph, but adding any new edge into G creates exactly one copy of H. Let C4+ be the…