MA010 Graph Theory (an online guide)
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatBonus Assignments
-
•How "deep" is this graph 6. 12. 2012
-
Stationary Cops Catching a Robber in a Graph 30. 11. 2011
-
One (mobile) Cop Catching a Robber in a Graph 30. 11. 2011
-
•Labeled Neighbourhoods in Planar Graphs 6. 12. 2012
-
-
Nyní studovatLecture 1: What is a graph
-
Nyní studovatCommon Topics and Applications of Graphs
-
Nyní studovatLecture 2: Connectivity in Graphs
-
Nyní studovatLecture 3: Graph distance
-
Nyní studovatLecture 4: Network flows
-
Nyní studovatLecture 5: Basics of trees
-
Nyní studovatOther Interesting Areas of Graphs
-
Nyní studovatLecture 6: MST and greedy algorithms
-
Nyní studovatLecture 7: Colourings, and other hard problems
-
Nyní studovatLecture 8: Planarity and drawings of graphs
-
Nyní studovatSome Advanced Lectures on Graphs *
-
Nyní studovatLecture 9*: Intersection graphs in brief
-
Nyní studovatLecture 10*: Width measures and minors
-
Nyní studovatLecture 11*: Advanced drawings of graphs
-
Nyní studovatLecture 12*: Introduction to Ramsey theory
-
Some Advanced Lectures on Graphs *
Subsequent lectures (nine to higher) present, time depending, some additional interesting graph material which will not be examined directly (though its knowledge will also be helpful at the final exam). The contents of these additional lectures may vary from year to year, and not all extra topics outlined in this syllabus will be presented.
Generally, the additional topics are not covered at all by the course textbooks, and only online materials are presented for them.
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatBonus Assignments
-
•How "deep" is this graph 6. 12. 2012
-
Stationary Cops Catching a Robber in a Graph 30. 11. 2011
-
One (mobile) Cop Catching a Robber in a Graph 30. 11. 2011
-
•Labeled Neighbourhoods in Planar Graphs 6. 12. 2012
-
-
Nyní studovatLecture 1: What is a graph
-
Nyní studovatCommon Topics and Applications of Graphs
-
Nyní studovatLecture 2: Connectivity in Graphs
-
Nyní studovatLecture 3: Graph distance
-
Nyní studovatLecture 4: Network flows
-
Nyní studovatLecture 5: Basics of trees
-
Nyní studovatOther Interesting Areas of Graphs
-
Nyní studovatLecture 6: MST and greedy algorithms
-
Nyní studovatLecture 7: Colourings, and other hard problems
-
Nyní studovatLecture 8: Planarity and drawings of graphs
-
Nyní studovatSome Advanced Lectures on Graphs *
-
Nyní studovatLecture 9*: Intersection graphs in brief
-
Nyní studovatLecture 10*: Width measures and minors
-
Nyní studovatLecture 11*: Advanced drawings of graphs
-
Nyní studovatLecture 12*: Introduction to Ramsey theory
-