Toggle navigation
Subruk's Site
Home
Publications
Students
Teaching
Contact
NP-completeness
On the Tractability of $(k,i)$-Coloring
×
Cite