2 citations · 5 across the 11 of their papers we have counts for
3 papers · 1 filter
The polytope of degree partitions
Amitava Bhattacharya, S. Sivasubramanian, Murali K. Srinivasan
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the conve…
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…
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…