University of Bialystok - Central Authentication System

Introduction to Graph Theory

General data

Course ID:	360-MS1-2ZTGa
Erasmus code / ISCED:	11.104 Kod klasyfikacyjny przedmiotu składa się z trzech do pięciu cyfr, przy czym trzy pierwsze oznaczają klasyfikację dziedziny wg. Listy kodów dziedzin obowiązującej w programie Socrates/Erasmus, czwarta (dotąd na ogół 0) – ewentualne uszczegółowienie informacji o dyscyplinie, piąta – stopień zaawansowania przedmiotu ustalony na podstawie roku studiów, dla którego przedmiot jest przeznaczony. / (0541) Mathematics The ISCED (International Standard Classification of Education) code has been designed by UNESCO.
Course title:	Introduction to Graph Theory
Name in Polish:	Introduction to Graph Theory
Organizational unit:	Faculty of Mathematics
Course groups:
ECTS credit allocation (and other scores):	4.00 Basic information on ECTS credits allocation principles: the annual hourly workload of the student’s work required to achieve the expected learning outcomes for a given stage is 1500-1800h, corresponding to 60 ECTS; the student’s weekly hourly workload is 45 h; 1 ECTS point corresponds to 25-30 hours of student work needed to achieve the assumed learning outcomes; weekly student workload necessary to achieve the assumed learning outcomes allows to obtain 1.5 ECTS; work required to pass the course, which has been assigned 3 ECTS, constitutes 10% of the semester student load. view allocation of credits
Language:	English
Type of course:	obligatory courses
Short description:	(in Polish) 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:	(in Polish) Course profile: academic Form of study: stationary Course type: obligatory Academic discipline: science and natural science, 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:	(in Polish) 1) R. J. Wilson, Introduction to graph theory, Pearson, 2010 2) R. Diestel, Graph Theory, Springer Verlag, 2000
Learning outcomes:	(in Polish) Learning outcomes: Knows fundamental notions of the Graph Theory; can give examples illustrating various types of graphs he was tought about. 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. Knows basic applications of graph theory in finding (in practice) a shortest path in various examples. Learns methodological bases for the applying graph theory in everyday problems and solving its elementary problems. KA6_WG01, KA6_WG03, KA6_WG04, KA6_WG02, KA6_UK01, KA6_UK02, KA6_UW02, KA6_UW03, KA6_UW06, KA6_UW18, KA6_UK03, KA6_WK01, KA6_UW15, KA6_KK01, KA6_UU01, KA6_KK02
Assessment methods and assessment criteria:	(in Polish) The overall form of credit for the course: test

Classes in period "Academic year 2022/2023" (past)

Time span:	2022-10-01 - 2023-06-30	Selected timetable range: weekly course term Navigate to timetable MO TU W TH FR WYK CW
Type of class:	Class, 30 hours more information Lecture, 15 hours more information
Coordinators:	Tomasz Czyżycki, Aneta Sliżewska, Mariusz Żynel
Group instructors:	Mariusz Żynel
Students list:	(inaccessible to you)
Examination:	Course - Grading Class - Grading

Course descriptions are protected by copyright.
Copyright by University of Bialystok.