On the Oriented Coloring of the Disjoint Union of Graphs
Offered By: Fields Institute via YouTube
Course Description
Overview
Explore the concept of oriented coloring in the context of disjoint union of graphs in this 30-minute lecture presented by Mateus de Paula Ferreira from Universidade Federal de Goiás at the 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021). Delve into the mathematical intricacies of graph theory and combinatorial algorithms as the speaker discusses the challenges and implications of applying oriented coloring techniques to disjoint graph unions. Gain insights into this specialized area of study and its potential applications in various fields of mathematics and computer science.
Syllabus
On the oriented coloring of the disjoint union of graphs
Taught by
Fields Institute
Related Courses
Comparing Genes, Proteins, and Genomes (Bioinformatics III)University of California, San Diego via Coursera Molecular Evolution (Bioinformatics IV)
University of California, San Diego via Coursera Approximation Algorithms for Hitting Subgraphs
Fields Institute via YouTube Reconfiguring Simple ST Hamiltonian Paths in Rectangular Grid Graphs
Fields Institute via YouTube How to Allow Deep Learning on Your Data Without Revealing Your Data
Institute for Pure & Applied Mathematics (IPAM) via YouTube