6 citations · 7 across the 13 of their papers we have counts for
1 paper · 2 filters
Feodor F. Dragan, Guillaume Ducoffe
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distan…