1 paper
Maria Axenovich, Kolja Knauer, Judith Stumpp +1
A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multico…