Recognition of graph families. Let F be a family of finite simple graphs, such as planar graphs, Cayley graphs, 4-colorable graphs, etc. The basic question is whether there exists a polynomial-time algorithm to decide whether a given graph G belongs to F. Do you know any summary (for example in the form of table) with state-of-the-art for this problem: for which families F there is a polynomial algorithm (and what is the fastest known algorithm), for which families the problem is NP complete, and for which families it is open.
 A: Permit me to direct you to the Wikipedia page on "Forbidden graph characterization,"
which contains a long table of graph classes that have a forbidden subgraph characterizations.
For example, chordal graphs may be characterized as those with no cycles of length $\ge 4$.
Then the "Robertson–Seymour theorem" is relevant, for it implies that

for every minor-closed family $F$, there is polynomial time algorithm for testing whether a graph belongs to $F$.

And the R-S theorem itself says that every minor-closed family can be defined by a finite set of forbidden minors, e.g., $K_5$ and $K_{3,3}$ for planar graphs.
A: It's too big to fit into one table, but I believe what you want is the Information System on Graph Classes and their Inclusions. In particular, for each of over 1200 graph classes listed on this site, it includes the known results on the complexity of several important computational problems on graphs in that class, including recognition.
A: Garey, Michael R. – Johnson, David S., Computers and intractability, a guide to the theory of NP-completeness, 1979.  It's a nice book which includes many problems about decision problems on graphs.  It even gives a general sufficient condition that makes recognizing a class of graphs NP-complete.  I don't remember the details, but I think it has to do with the class being monotonous.
