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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer