8 citations · 16 across the 10 of their papers we have counts for
1 paper · 2 filters
Aurosish Mishra, Pavol Hell
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the…