Resources for complexity results for optimization problems in restricted graph classes I am specifically interested in optimization problems in graphs (minimum coloring, maximum clique, maximum matching etc.) and I need a resource (database) which contains complexity results on different graph classes. The best resource that I know is the following:

http://graphclasses.org/

I think this web site is great because it covers all the graph classes, however the results presented (recognition, independent set, domination) in the site and my interests do not match. 

I am looking for similar resources.

Thanks.
Get Spinrad's book on efficient graph representations:
http://www.amazon.com/Efficient-Representations-Fields-Institute-Monographs/dp/0821828150

Also check out Li and Vitanyai's book on Kolmogorov Complexity:
http://www.amazon.com/Efficient-Representations-Fields-Institute-Monographs/dp/0821828150

You will get an appriciation for each graph class by studying succinct data structures.  When you understand why certain classes of graphs take less storage than others you gain a great understanding of how to tailor optimization problems on to them.