8 citations · 9 across the 18 of their papers we have counts for
1 paper · 1 filter
Vladislav Taranchuk
For integers n≥k≥2, let c(n,k) be the minimum number of chords that must be added to a cycle of length n so that the resulting graph has the property that for every…