sentence1: many optimization problems that are np-hard on a general graph are solvable in polynomial time on ahalin graph .
sentence2: many optimization problems that are np-hard on a general graph are solvable in polynomial time on a halin graph .