The Rainbow Arborescence Problem on Cycles
By: Kristóf Bérczi , Tamás Király , Yutaro Yamaguchi and more
Potential Business Impact:
Proves a math idea about colorful graph paths.
The rainbow arborescence conjecture posits that if the arcs of a directed graph with $n$ vertices are colored by $n-1$ colors such that each color class forms a spanning arborescence, then there is a spanning arborescence that contains exactly one arc of every color. We prove that the conjecture is true if the underlying undirected graph is a cycle.
Similar Papers
Rainbow Trees in Hypercubes
Combinatorics
Finds hidden paths in computer networks.
The Steiner Path Aggregation Problem
Data Structures and Algorithms
Makes computer paths less confusing for many users.
On acyclic b-chromatic number of cubic graphs
Combinatorics
Finds the most colors for a special graph map.