Introduction to Graph Theory
General data
Course ID:  0600MS12ZTG  Erasmus code / ISCED:  11.104 / (unknown) 
Course title:  Introduction to Graph Theory  Name in Polish:  Wprowadzenie do teorii grafów 
Department:  (in Polish) Zakład Dydaktyki i Nowoczesnych Technologii w Kształceniu  
Course groups: 
(in Polish) 2 rok 1 stopnia sem. zimowy Matematyka spec. Teoretyczna (in Polish) 3L stac. I st. studia matematyki  przedmioty obowiązkowe 

ECTS credit allocation (and other scores): 
4.00 view allocation of credits 

Language:  Polish  
Type of course:  obligatory courses 

Mode:  (in Polish) w sali 

Short description: 
Course objectives: A student will acquire knowledge in rudiments of graph theory. He will also get basic information on applications of the theory. 

Full description: 
Course profile: academic Form of study: stationary Course type: obligatory Academic discipline: Mathematics, field of study in the arts and science: mathematics Year: 2, semester: 3 Prerequisities: Combinatorics lecture 15 h. exercise class 30 h. Verification methods: lectures, exercises, consultations, studying literature, home works, discussions in groups. ECTS credits: 4 Balance of student workload: attending lectures15x1h = 15h attending exercise classes 7x4h + 2h(preliminary teaching) = 30h preparation for classes 7x3h = 21h completing notes after exercises and lectures 9x2h = 18h consultations 5x1h = 5h final work: preparation and take 10h + 2h = 12h Quantitative description Direct interaction with the teacher: 53 h., 2 ECTS Practical exercises: 74 h., 4 ECTS 

Bibliography: 
R. Diestel, Graph Theory, Springer Verlag, 2000 

Learning outcomes: 
Learning outcomes: Knows fundamental notions of the Graph Theory; can give examples illustrating various types of graphs he was tought about.K_W02, K_W04, K_W05, K_W06, K_U01, K_U02, K_U03, K_U06, K_U11, K_U29, K_U36 Knows the notions of a path, cycle, Euler graph, and Hamilton graph. He also knows theorems associated with problems where these graphs appeared (the Euler, the Ore, and the Dirac Theorems) and can apply these theorems to concrete graphs and classes of graphs.K_W02, K_W04, K_W05, K_W06, K_U01, K_U02, K_U03, K_U06, K_U11, K_U29, K_U36 Knows basic applications of graph theory in finding (in practice) a shortest path in various examples.K_W01, K_W02, K_W03, K_W05, K_W06, K_U01, K_U02, K_U03, K_U06, K_U11, K_U25, K_U29, K_U36 Learns methodological bases for the applying graph theory in everyday problems and solving its elementary problems.K_K01, K_K02, K_K07 

Assessment methods and assessment criteria: 
The overall form of credit for the course: test 
Classes in period "Academic year 2017/2018" (past)
Time span:  20171001  20180630 
see course schedule 
Type of class: 
Class, 30 hours more information Lecture, 30 hours more information 

Coordinators:  Krzysztof BelinaPrażmowskiKryński  
Group instructors:  Krzysztof BelinaPrażmowskiKryński  
Students list:  (inaccessible to you)  
Examination:  Grading 
Classes in period "Academic year 2018/2019" (future)
Time span:  20181001  20190630 
see course schedule 
Type of class: 
Class, 30 hours more information Lecture, 30 hours more information 

Coordinators:  (unknown)  
Group instructors:  (unknown)  
Students list:  (inaccessible to you)  
Examination:  Grading 
Copyright by University of Bialystok.