Constructing Knowledge in Graph Theory and Combinatorial Optimization

摘要

Graph theory and combinatorial optimization are powerful tools for teachers allowing them to develop logical thinking of students, increase their imagination and make them familiar with solutions to various practical problems. The paper offers some ideas how to make the teaching of these branches of applied mathematics and computer science more understandable and attractive. A case study is described which introduces the minimum spanning tree problem, its remarkable origin, and then its relation to the other problems. The approach used for teaching and learning graph theory and combinatorial optimization can serve as an inspiration for instruction of other subjects as well.