J. Mark Keil Lorna Stewart Approximating the minimum clique cover and other hard problems in subtree filament graphs. 1983-1995 2006 154 Discrete Applied Mathematics 14 http://dx.doi.org/10.1016/j.dam.2006.03.003 db/journals/dam/dam154.html#KeilS06