2 citations · 2 across the 1 of their papers we have counts for
1 paper
Kyohei Kozawa, Yota Otachi
We present a tight lower bound for the spanning tree congestion of Hamming graphs.