4 citations · 4 across the 4 of their papers we have counts for
1 paper · 2 filters
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
In an attempt to find a polynomial-time algorithm for the edge-clique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. Ho…