Exercises for Discrete Mathematics a course at the Faculty of Computer and Information Science, University of Ljubljana.
Gradiva za vaje iz diskretne matematike, predmet na Fakulteti za računalništvo in informatiko Univerze v Ljubljani.
Link to the book.
Chapter 1.Introduction to SageMath
Chapter 2. Depth-first search and breadth-first search
Chapter 3. Low value and 2-connected components
Chapter 4. Shortest Hamiltonian cycle (Traveling salesman problem)
Chapter 5. Graph drawing
Chapter 6. 3-colooring planar graphs without short cycles
Chapter 7. 5-coloring planar graphs
Chapter 8. List coloring of planar triangulations
Chapter 9. Balanced cycle separators in planar graphs
Chapter 10. Chordal graphs
Chapter 11. Tree decomposition
Chapter 12. Maximum independent set
Chapter 13. Matchings and covers in bipartite graphs
Chapter 14. Stable matchings