Semester:
8th
Course Type:
Elective Specialization courses (ΠΜ-E)
Track:
CS (Computer Science), CΕT (Computer Engineering and Telecoms)
Code:
ΘΠ10
ECTS:
6
TEACHING HOURS per week
Theory:
3
Seminar:
1
Laboratory:
-
Specializations
Foundations of Computer Science (S1):
B Βασικό
Data and Knowledge Management (S2):
-
Software (S3):
-
Hardware and Architecture (S4):
-
Communications and Networking (S5):
-
Signal and Information Processing (S6):
-
Related Courses
Detailed Description
Course Content
Paths, trees. Vertex- and edge-separators, connectivity. Menger’s Theorem. Matchings. Tutte’s Theorem. Vertex Covers. Planarity, outer-planarity. Unique Embeddings. Whitney’s Theorem. Pathwidth and Treewidth . Graph coloring. Brooks’ Theorem. Mycielski’s construction.
LITERATURE AND STUDY MATERIALS - READING LIST
S. Kolliopoulos, Lecture Notes.
Rheihnard Diestel. Graph Theory, 5th Edition, Springer, 2016.
Douglas B. West. Introduction to Graph Theory, 2nd Edition, Pearson, 2001
K.H. Rosen. Διακριτά Μαθηματικά και Εφαρμογές τους. 7η Έκδοση, Εκδόσεις Τζιόλα, 2015 (greek edition of K. H. Rosen’s Discrete Mathematics and its applications.)
e-Class link