The classification problem for graphs and lattices is wild
arXiv:1008.4903
Abstract
We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification problem for pairs of matrices up to simultaneous similarity.
Published under a different name with some additions - this one is redundant