Employment
-
Indian Statisitical Institute2013 - Present
Education
Education history is unavailable.
Projects & Funding
Projects & funding information is unavailable.
Publications (11)
- Tight chromatic bounds for (P2+P4, K4−e)-free graphs Save
- On near optimal colorable graphs Save
- Optimal coloring of (P2 + P3, gem)-free graphs Save
- On Graphs With No Induced P5 or K5−e Save
- χ-boundedness and related problems on graphs without long induced paths: A survey Save
- Improved bounds on the chromatic number of (P5, flag)-free graphs Save
- Coloring of (P5, 4-wheel)-free graphs Save
- On graphs with no induced five‐vertex path or paraglider Save
- Structural domination and coloring of some (P7,C7)-free graphs Save
- Coloring graphs with no induced five‐vertex path or gem Save