8 citations · 11 across the 14 of their papers we have counts for
1 paper · 1 filter
Saeed Shaebani
A vertex coloring of a graph G with nonempty color classes V1,V2,…,Vk is called a \emph{FAT k-coloring} if there exist real numbers α,β∈[0,1] such that for every v…