activity
20112026
most citedClasses of graphs with no long cycle as a vertex-minor are polynomially -bounded

9 citations · 27 across the 19 of their papers we have counts for

collaborators
Showing 2014Show all

2 papers · 1 filter

math.CO2014

Frustration in signed graphs

Vaidy Sivaraman

Zaslavsky conjectured the following: The minimum number of vertices to be deleted to restore balance in a subcubic signed graph is the same as the minimum number of edges to be del…

math.CO2014★ 1 cited

A unified proof of Brooks' theorem and Catlin's theorem

Vaidy Sivaraman

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.