Cerioli, Marcia R.; Faria, Luerbio; Ferreira, Talita O.; Protti, Fábio A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. (English) Zbl 1228.05224 RAIRO, Theor. Inform. Appl. 45, No. 3, 331-346 (2011). MSC: 05C69 05C75 68W25 68Q25 PDFBibTeX XMLCite \textit{M. R. Cerioli} et al., RAIRO, Theor. Inform. Appl. 45, No. 3, 331--346 (2011; Zbl 1228.05224) Full Text: DOI Numdam EuDML
Cerioli, M. R.; Faria, L.; Ferreira, T. O.; Martinhon, C. A. J.; Protti, F.; Reed, B. Partition into cliques for cubic graphs: Planar case, complexity and approximation. (English) Zbl 1144.05049 Discrete Appl. Math. 156, No. 12, 2270-2278 (2008). MSC: 05C70 05C35 68R10 PDFBibTeX XMLCite \textit{M. R. Cerioli} et al., Discrete Appl. Math. 156, No. 12, 2270--2278 (2008; Zbl 1144.05049) Full Text: DOI
Cerioli, M. R.; Faria, L.; Ferreira, T. O.; Protti, F. On minimum clique partition and maximum independent sets on unit disk graphs and penny graphs: complexity and approximation. (English) Zbl 1075.05571 Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 73-79 (2004). MSC: 05C69 68R10 PDFBibTeX XMLCite \textit{M. R. Cerioli} et al., Electron. Notes Discrete Math. 18, 73--79 (2004; Zbl 1075.05571) Full Text: Link