1 citations · 1 across the 3 of their papers we have counts for
1 paper · 2 filters
Jürgen Kritschgau, tahda queer, Cyrus Young +1
Given an edge-colored graph G, we denote the number of colors as c(G), and the number of edges as e(G). An edge-colored graph is rainbow if no two edges share the same color.…