1 paper
Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi +2
In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The problem maximum edge 2…