Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-08)
    Consider a graph G=(V,E) and a coloring c of vertices with colors from [ℓ]. A vertex v is said to be happy with respect to c if c(v)=c(u) for all neighbors u of v. Further, an edge (u,v) is happy if c(u)=c(v). Given a ...

Search Digital Repository


Browse

My Account