I don't see anything in the article that shows that he made the statement about NP-completeness. It seems that the quoted chemist made that statement.<p>For someone who's not a graph theorist, it's an easy mistake to make, since the longest path problem is, in general, NP-complete. He was probably just thinking of this problem.