On the Oriented Coloring of the Disjoint Union of Graphs

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.