22 citations · 92 across the 73 of their papers we have counts for
1 paper · 1 filter
Daniel W. Cranston, Douglas B. West
A graph is (7, 2)-edge-choosable if, for every assignment of lists of size 7 to the edges, it is possible to choose two colors for each edge from its list so that no color is chose…