3 citations · 3 across the 6 of their papers we have counts for
1 paper · 1 filter
Bart M. P. Jansen, Astrid Pieterse
We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected)…