The objective of this project is to investigate the computational complexity of various graph problems when the input graphs are restricted to, or the graphs corresponding to the outputs are restricted to special classes of graphs known as hereditary graph classes - the classes of graphs which are closed under vertex deletion.
Indian Institute of Technology Dharwad
Acces sibility Controls