Jinal Tapar
Jinal Tapar
Home
Research
Publications
Contact
CS Theory
On the tractability of $(k,i)$-coloring (Extended Journal Version)
This paper is primarily about NP-completeness of $(k,i)$-coloring of graph and giving a parameterized algorithm for this problem using feedback vertex set as the parameter.
On the tractability of $(k,i)$-coloring
This paper is primarily provides a parameterized algorithm for $(k,i)$-coloring problem using feedback vertex set as the parameter.
Cite
×