6 citations · 12 across the 18 of their papers we have counts for
1 paper · 1 filter
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov +1
Covering and partitioning the edges of a graph into cliques are classical problems at the intersection of combinatorial optimization and graph theory, having been studied through a…