What are the implications of P=NP?
If P=NP, then all of the NP problems can be solved deterministically in Polynomial time. 

This is because the NP problems are all essentially the same problem, just stated in different terms. 

As far as lists go -- many of the NP-Complete problems are enumerated here:
https://en.wikipedia.org/wiki/List_of_NP-complete_problems 

Further implications? Our cryptosystems break down, armchair philosophers argue about what it means, the world changes, and somebody gets a Fields medal or Turing award + a big hunk of cash, etc... but that's a tangent. 

For example, one of the classic NP problems is clique. If you could solve clique with a polynomial time algorithm, this would prove that P=NP, and then you could also use your method for solving clique to solve all of the other problems on that wiki-list, as an implication.