Lectures and discussions
- Graphs, simple graphs. Incidence matrix and adjacency matrix. Subgraphs. Degree of a vertex.
- Paths and cycles.
- Trees, bridges and cuts.
- Graph isomorphisms.
- Connectivity and blocks. Cut sets.
- Matching and covers in general and bipartite graphs. Perfect matchings.
- Edge colorings. Chromatic index, Vizing's Theorem.
- Vertex colorings, Chromatic number, Brook's Theorem.
- Planar graphs. Dual graphs, Euler's formula for connected planar graphs, Kuratowski's Theorem. Four Color Theorem.
- Non-planar graph, measures of non-planarity.
- Eulerian and Hamiltonian graphs.
- Oriented graphs. Oriented paths and cycles.
- Tournaments and graph models
- Graphs, simple graphs. Incidence matrix and adjacency matrix. Subgraphs. Degree of a vertex.
- Paths and cycles.
- Trees, bridges and cuts.
- Graph isomorphisms.
- Connectivity and blocks. Cut sets.
- Matching and covers in general and bipartite graphs. Perfect matchings.
- Edge colorings. Chromatic index, Vizing's Theorem.
- Vertex colorings, Chromatic number, Brook's Theorem.
- Planar graphs. Dual graphs, Euler's formula for connected planar graphs, Kuratowski's Theorem. Four Color Theorem.
- Non-planar graph, measures of non-planarity.
- Eulerian and Hamiltonian graphs.
- Oriented graphs. Oriented paths and cycles.
- Tournaments and graph models