Reducibility among NP-Hard graph problems and boundary classes

Syed Mujtaba Hassan, Shahid Hussain, Abdul Samad

Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when doe…