15 citations · 20 across the 14 of their papers we have counts for
1 paper · 1 filter
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare +1
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of…