About this Course

118,893 recent views

Learner Career Outcomes

33%

started a new career after completing these courses

50%

got a tangible career benefit from this course

33%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Beginner Level
Approx. 20 hours to complete
English

Learner Career Outcomes

33%

started a new career after completing these courses

50%

got a tangible career benefit from this course

33%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Beginner Level
Approx. 20 hours to complete
English

Offered by

Placeholder

University of California San Diego

Placeholder

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Content RatingThumbs Up87%(7,662 ratings)Info
Week
1

Week 1

3 hours to complete

What is a Graph?

3 hours to complete
14 videos (Total 52 min), 5 readings, 5 quizzes
14 videos
Knight Transposition2m
Seven Bridges of Königsberg4m
What is a Graph?7m
Graph Examples2m
Graph Applications3m
Vertex Degree3m
Paths5m
Connectivity2m
Directed Graphs3m
Weighted Graphs2m
Paths, Cycles and Complete Graphs2m
Trees6m
Bipartite Graphs4m
5 readings
Slides1m
Slides1m
Slides1m
Slides1m
Glossary10m
2 practice exercises
Definitions10m
Graph Types10m
Week
2

Week 2

5 hours to complete

CYCLES

5 hours to complete
12 videos (Total 89 min), 4 readings, 6 quizzes
12 videos
Total Degree5m
Connected Components7m
Guarini Puzzle: Code6m
Lower Bound5m
The Heaviest Stone6m
Directed Acyclic Graphs10m
Strongly Connected Components7m
Eulerian Cycles4m
Eulerian Cycles: Criteria11m
Hamiltonian Cycles4m
Genome Assembly12m
4 readings
Slides1m
Slides1m
Slides1m
Glossary10m
4 practice exercises
Computing the Number of Edges10m
Number of Connected Components10m
Number of Strongly Connected Components10m
Eulerian Cycles30m
Week
3

Week 3

4 hours to complete

Graph Classes

4 hours to complete
11 videos (Total 55 min), 4 readings, 6 quizzes
11 videos
Trees8m
Minimum Spanning Tree6m
Job Assignment3m
Bipartite Graphs5m
Matchings3m
Hall's Theorem7m
Subway Lines1m
Planar Graphs3m
Euler's Formula4m
Applications of Euler's Formula7m
4 readings
Slides1m
Slides1m
Slides1m
Glossary10m
3 practice exercises
Trees10m
Bipartite Graphs10m
Planar Graphs10m
Week
4

Week 4

4 hours to complete

Graph Parameters

4 hours to complete
14 videos (Total 52 min), 5 readings, 8 quizzes
14 videos
Graph Coloring3m
Bounds on the Chromatic Number3m
Applications3m
Graph Cliques3m
Cliques and Independent Sets3m
Connections to Coloring1m
Mantel's Theorem5m
Balanced Graphs2m
Ramsey Numbers2m
Existence of Ramsey Numbers5m
Antivirus System2m
Vertex Covers3m
König's Theorem8m
5 readings
Slides1m
Slides1m
Slides1m
Slides1m
Glossary10m
4 practice exercises
Graph Coloring10m
Cliques and Independent Sets10m
Ramsey Numbers10m
Vertex Covers10m

Reviews

TOP REVIEWS FROM INTRODUCTION TO GRAPH THEORY

View all reviews

About the Introduction to Discrete Mathematics for Computer Science Specialization

Introduction to Discrete Mathematics for Computer Science

Frequently Asked Questions

More questions? Visit the Learner Help Center.