• Graph and digraph (paths, cycles, stable, complete, bipartite graph, degree, in-degree, out-degree, directed path, tournaments)
• Connectivity: trees, branching, blocks, connectivity and edge-connectivity, strong digraphs.
• Covering (by paths, cycles, edges, Hamiltonian graphs).
• Colorings (definition, Brooks theorem, colorings and orientations).
• Planar graphs (Kuratowski).
• Tournaments (Summer’s conjecture).