Graph Theory

Lecturer:

Tutor:

Supervisor:

Department of Applied Informatics

Synopsis:

Graph theory - basic elements, graph tasks formulations, basic algorithms with recognition of calculation efficiency. Connectivity, strong connectivity, trees, spanning trees, flows in networks, matchings, eulerian trails, hamiltonian paths, independent sets, cliques, coloring, plannar graphs.

Requirements:

no prerequisities

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Ability to use the graph as means of expression to model real situations, ability to solve basic graph problems.

Study materials:

Diestel, R.: Graph Theory, Springer, 1996,

Swamy, M., N., S., Thulasiraman, K., Graphs, Networks and Algorithms. New York, John Wiley&Sons, Inc., 1981.

Demel, J.: Graphs and their Applications, (internal material).

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: