3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Yongxin Lan, Yongtang Shi, Yiqiao Wang +1
A graph G is called Ck-saturated if G is Ck-free but G+e not for any e∈E(G). The saturation number of Ck, denoted sat(n,Ck), is the minimum number…