The Complexity of 3-Colouring H-Colourable Graphs
Offered By: IEEE via YouTube
Course Description
Overview
Explore the intricacies of graph theory in this 21-minute IEEE conference talk presented by Andrei Krokhin and Jakub Opršal. Delve into the fascinating world of graph coloring as the speakers examine the complexity of 3-colouring H-colourable graphs. Gain insights into the mathematical challenges and algorithmic approaches involved in this specific area of graph theory, enhancing your understanding of computational complexity and graph algorithms.
Syllabus
The complexity of 3-colouring H-colourable graphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera