24 IV 98

14:58 Departure from Katowice
18:00 Arriving in Zarzecze, accommodation
19:00 Opening of the Session: talk by dr Adam Kolany.
20:00 Supper
20:30 Discussion: "The meaning of the word should in sentences like: higher education should be free, etc."

25 IV 98

9:00  Breakfast and discussion: "How to increase number of SMS' members."
10:00 Beginning of the pre-dinner session - talks.
14:00 Outing for the dinner.
16:00 Afternoon session - talks.
20:30 Discussion: "RSS - playing the game of the welfare's autonomy, but who's to pay fo it?"

26 IV 98

9:00  Breakfast
10:00 Visiting the neighbourhood. Dinner. 
14:00 Session's summarise. Talk by dr marek Szyjewski.
15:00 Packing, cleaning.
16:00 Departure to Katowice.

Radosław Czaja Piotr Elfinger Agnieszka Furmankiewicz Paweł Gładki Renata Gołkowska Tatiana Korzeniowska Grzegorz Łuc Joanna Napiórkowska Izabela Papuga Tomasz Powierża

Krzysztof Nowak Bibianna Sonelska Michał Trzęsiok Michał Wojtylak Tomasz Wrona Katarzyna Wróbel Adam Kolany Michał Kolany Marek Szyjewski

MSc Tomasz Powierża	Euler's Graphs
MSc Tomasz Powierża	Hamilton's paths and circuits, the traveling salesman problem
Michał Trzęsiok	Finding the number of trees, finding graph's dendrites
Michał Trzęsiok	Planar Graphs, Kuratowski's graphs, detecting the planarity.
Tatiana Korzeniowska	Vector space of graphs.
Tatiana Korzeniowska	Matrix representation of graphs.
Izabela Papuga	Graph's chromatics, associations and coverings, four colour problem.
Piotr Elfinger	Directed graphs, matrix representation of directed graphs, decyclisation.
Radosław Czaja	Algorythms of graph theory.
Grzegorz Łuc	Graphs in the theory of switching circuits and in the coding theory.
Grzegorz Łuc	Graphs in the analysis of electric circuits.
Piotr Elfinger	Graphs in the theory of operational researches.
Radosław Czaja	Graphs in the Chemistry and other applications.
Bibianna Sonelska	Nets, flows, and other basic notions of graph theory.
Paweł Gładki	Stock and demand theorem.
Tomasz Wrona	Twierdzenie o opływie
Paweł Gładki	Konig-Egervary's and Menger's theorem.
Michał Wojtylak	Minimal number of schedule executors
Agnieszka Furmankiewicz	The subgraph problem.
MSc Joanna Napiórkowska	The Hitchcock's problem, the optimal flow problem, the minimal cost flow.
Renata Gołkowska	The stock and demand problem when the cost minimal.
Krzysztof Nowak	Storage problem, restaurateur problem, curves of project costs.