UFABC - Mota
UFABC - Mota - TIDIA
UFABC - Carla
UFABC - Carla - TIDIA
Week 01
17/09 | Introduction and Graphs
19/09 | Basic Concepts and Representations
Week 02
24/09 | Mantel and Turán's Theorem: Subgraph, Rides, Tracks, Paths, Cycles and Isomorphisms
26/09 | Components, cut-edges and cut-vertices / Bipartite Graphs
Week 03
01/10 | Eulerian Graphs and Characterization
03/10 | Eulerian Graphs - Fleury's Algorithm
Week 04
08/10 | Depth-first Search with Correctness
10/10 | Dijkstra with Correctness
Week 05
15/10 | Trees
17/10 | Trees and Characterization / Minimum Spanning Tree
Week 06
22/10 | Digraphs and Strongly Connected Components
24/10 | Revision/Exercises
Week 07
29/10 | Exam 1
31/10 | Pairing and Berge's Theorem
Week 08
05/11 | Hall's Theorem and Corollaries
07/11 | Connectedness
Week 09
12/11 | Hamiltonians and Dirac's Theorem
14/11 | Coloring of Vertices
Week 10
19/11 | Holiday 🎉
21/11 | Coloring Edges
Week 11
26/11 | Independent Sets and Clicks
28/11 | Planarity
Week 12
03/12 | Revision/Exercises
05/12 | Exam 2
-- E1: Exam 1
-- E2: Exam 2
-- A: Assignments
rating = 0.35 E1 + 0.45 E2 + 0.2 A
grade :: Double -> Char
grade rating
| rating >= 8.5 = 'A'
| rating >= 7 = 'B'
| rating >= 6 = 'C'
| rating >= 5 = 'D'
| otherwise = 'F'Scheduled Lectures
| Course Number | Meeting Time | Classroom Location |
|---|---|---|
| A1D | Mon (10:00 - 12:00) Wed (08:00 - 10:00) |
S-301-3 |
| A1N/A2N | Mon (21:00 - 23:00) Wed (19:00 - 21:00) |
S-206-0 |
Office Hours
| Who? | Meeting Time | Classroom Location |
|---|---|---|
| Prof. Dr. Guilherme Oliveira Mota | Mon (20:00 - 21:00) Wed (18:00 - 19:00) |
S-530-2 |
| Profa. Dra. Carla Negri Lintzmayer | Tue (13:00 - 15:00) Thu (13:00 - 15:00) |
S-508-2 |
| Gabriel Fernandes + Richard Raphael | Tue (17:00 - 18:30) | S-308-3 |
I'm using some emojis to give you more information about these links.
- 💰 are paid tutorials, 🆓 are free tutorials. Sometimes you will have some free videos/articles and other paid on the same website.
- 📹 is present when video content is available
-
Communities
-
Books
- Análise de Algoritmos e Estruturas de Dados - Mota 🆓
- Teoria dos Grafos - Mota 🆓
- Graph Theory with Applications - Bondy 🆓
- Um Curso de Grafos - IME/USP 🆓
- Graph Theory 🆓
- Algorithmic Graph Theory 🆓
- Handbook of Graph Drawing and Visualization 🆓
- Uma Introdução Sucinta à Teoria dos Grafos - IME/USP 🆓
- Introduction to Algorithms - CLRS 💰
- Modern Graph Theory - Bollobás 💰
- Introduction to Graph Theory - West 💰
- Graphs and Digraphs - Chartrand 💰
-
Courses and Movies
- N is a Number - Erdos 📹 🆓
- Graph Theory Algorithms - Udemy 📹 🆓
- Introduction to Graph Theory - Coursera 📹 🆓
- MIT OCW 📹 🆓
- Graph Theory - NPTEL 📹 🆓
- Introdução à Teoria dos Grafos - OBMEP 📹 🆓
- Graph Theory - Udemy 📹 💰
- Introduction to Graph Theory - Univ. Rhode Island 🆓
- Teoria dos Grafos - Profa. Leticia/UFABC 🆓
- Teoria dos Grafos - Prof. Jair/UFABC 🆓
- Intro to Graph Theory - Prof. Aritanan/UFABC 🆓
- Geeks for Geeks 🆓
-
Tutorials, Videos and Articles
-
Quiz/Challenges
For bug fixes, documentation improvements, typos, translations (new/updates) and simple changes, just make a PR! 🎉
For more complex changes, pls, make an issue first so we can discuss the design.
Roadmap for contributing:
- Fork it.
- Create your feature branch (git checkout -b my-new-feature).
- Commit your changes (git commit -am 'Add some feature').
- Push to the branch (git push origin my-new-feature).
- Create new Pull Request.
This project is licensed under the GNU General Public License v2.0 - see the LICENSE.md for details. Have fun!
I follow most of the guidelines of UFABC Honor's Code. So, if you use any exercise solutions of this repository - total or partial -, in any evaluation process, you have to cite this on the terms of Honor's Code. Thank you!