Useful Links
Study guides
Linear algebra
Calculus
Statistics
Econometrics
Algorithms
>
Combinatorial algorithms
>
Combinatorial optimization
>
Rainbow problems
Algorithms
>
Search algorithms
>
Combinatorial optimization
>
Rainbow problems
Combinatorics
>
Combinatorial algorithms
>
Combinatorial optimization
>
Rainbow problems
Computational mathematics
>
Combinatorial algorithms
>
Combinatorial optimization
>
Rainbow problems
Graph theory
>
Network theory
>
Combinatorial optimization
>
Rainbow problems
Mathematical analysis
>
Mathematical optimization
>
Combinatorial optimization
>
Rainbow problems
Numerical analysis
>
Mathematical optimization
>
Combinatorial optimization
>
Rainbow problems
Operations research
>
Network theory
>
Combinatorial optimization
>
Rainbow problems
Category: Rainbow problems
Rainbow covering
No description available.
Colorful caratheodory theorem
No description available.
Rainbow matching
In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors.
Rainbow-independent set
In graph theory, a rainbow-independent set (ISR) is an independent set in a graph, in which each vertex has a different color. Formally, let G = (V, E) be a graph, and suppose vertex set V is partitio