activity
20112026
most citedClasses of graphs with no long cycle as a vertex-minor are polynomially -bounded

9 citations · 27 across the 19 of their papers we have counts for

collaborators
Showing 2017 · quant-phShow all

Nothing from them under that filter.

Their other years and fields are still on the left.