activity
20182026
most citedThe proper conflict-free -coloring problem and the odd -coloring problem are NP-complete on bipartite graphs

5 citations · 6 across the 20 of their papers we have counts for

collaborators
Showing 2022 · math.PRShow all

Nothing from them under that filter.

Their other years and fields are still on the left.