Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

The Complexity of 3-Colouring H-Colourable Graphs

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of The Complexity of 3-Colouring H-Colourable Graphs

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.