4 citations · 4 across the 2 of their papers we have counts for
1 paper · 2 filters
David P. Bunde, Kevin Milans, Douglas B. West +1
In a graph whose edges are colored, a parity walk is a walk that uses each color an even number of times. The parity edge chromatic number p(G) of a graph G is the least k so that…