Eskisehir Technical University Info Package Eskisehir Technical University Info Package
  • Info on the Institution
  • Info on Degree Programmes
  • Info for Students
  • Turkish
    • Turkish Turkish
    • English English
About the Program Educational Objectives Key Learning Outcomes Course Structure Diagram with Credits Field Qualifications Matrix of Course& Program Qualifications Matrix of Program Outcomes&Field Qualifications
  • Faculty of Science
  • Department of Mathematics
  • Course Structure Diagram with Credits
  • Introduction to Graph Theory
  • Learning Outcomes
  • Description
  • Learning Outcomes
  • Course's Contribution to Prog.
  • Learning Outcomes & Program Qualifications

  • Able to define the basic concepts of graphs, directed graphs, and weighted graphs.
  • Defines a graph, identifying edges and vertices.
  • Finds the degree of a vertex.
  • Expresses and proves handshaking lemma.
  • Able to list the certain special graphs and their basic properties.
  • Defines certain special graphs including complete graph, path, cycle, wheel, Petersen graph, etc., and explains their certain properties.
  • Determines whether the given graphs are isomorphic.
  • Defines and characterizes Eulerian graphs.
  • Defines and characterizes Hamiltonian graphs.
  • Defines the concepts of eccentricity, diameter, radius, etc., in connected graphs, and calculates them in a given graph.
  • Able to define tree.
  • Lists the basic properties of trees.
  • Expresses and proves Cayley's Theorem.
  • Solves various optimization problems with the help of trees.
  • Able to define planar graph.
  • Expresses and proves Euler's Formula for planar graphs.
  • Shows complete graph K_5 and complete bipartite graph K_{3,3} are not planar.
  • Uses Kuratowski's Theorem.
  • Is able to explain the concept of colorings and theory.
  • Defines the concept of chromatic number.
  • Uses graph coloring in solving various problems.
  • Finds the chromatic polynomial of a given graph.
  • Explains 4-color problem.
  • Able to express the concept of matching in graphs.
  • Expresses Hall's and Marriage theorems.
  • Finds the maximum matching using the augmented path algorithm.
  • Solves various problems using matching in graphs.

  • Info on the Institution
  • Name and Adress
  • Academic Calendar
  • Academic Authorities
  • General Description
  • List of Programmes Offered
  • General Admission Requirements
  • Recognition of Prior Learning
  • Registration Procedures
  • ECTS Credit Allocation
  • Academic Guidance
  • Info on Degree Programmes
  • Doctorate Degree / Proficieny in Arts
  • Master's Degree
  • Bachelor's Degree
  • Associate Degree
  • Open&Distance Education
  • Info for Students
  • Cost of living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Special Needs Students ı
  • Insurance
  • Financial Support for Students
  • Student Affairs Office
  • Info for Students
  • Learning Facilities
  • International Programmes r
  • Practical Information for Mobile Students
  • Language courses
  • Internships
  • Sports and Leisure Facilities
  • Student Associations