1 citations · 1 across the 4 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
math.CO2005
Alternating Reachability
Amitava Bhattacharya, Uri N. Peled, Murali K. Srinivasan
We consider a graph with colored edges. A trail (vertices may repeat but not edges) is called \emph{alternating} when successive edges have different colors. Given a set of vertice…
math.CO2005
Cones of closed alternating walks and trails
Amitava Bhattacharya, Uri N. Peled, Murali K. Srinivasan
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edge…