Know the following:

Graphs: K_n, C_n, P_n, K_n, m
Graph Types: M by N grids, trees, bipartite, planar, outerplanar
Concepts: degree, connected, 2-connected, Hamiltonian cycle,
          cut-vertex, bridge, chromatic number, matching,
          subgraph, induced subgraph, complement, clique, independent set,
          minor, dual, maximum vs. maximal, dominating set, perfect code,
          homomorphism, connectivity, edge-connectivity
Theorems: Brooks, 4-color, Max-Flow/Min-Cut, Menger's, Kuratowski's