Coloring Graphs to Produce Properly Colored Walks

Robert Melville, Wayne Goddard

For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair o…