B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1145/174644.174650

A. Caprara and R. Rizzi, Packing triangles in bounded degree graphs, Information Processing Letters, vol.84, issue.4, pp.175-180, 2002.
DOI : 10.1016/S0020-0190(02)00274-0

M. Chlebík and J. Chlebíková, On Approximability of the Independent Set Problem for Low Degree Graphs, LNCS 3104, pp.47-56, 2004.
DOI : 10.1007/978-3-540-27796-5_5

V. Guruswami, C. Pandu-rangan, M. S. Chang, G. J. Chang, and C. K. Wong, The K r -Packing Problem, Computing, vol.66, issue.1, pp.79-89, 2001.
DOI : 10.1007/s006070170039

I. Holyer, The NP-Completeness of Some Edge-Partition Problems, SIAM Journal on Computing, vol.10, issue.4, pp.713-717, 1981.
DOI : 10.1137/0210054

C. A. Hurkens and A. Schrijver, of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems, SIAM Journal on Discrete Mathematics, vol.2, issue.1, pp.68-72, 1989.
DOI : 10.1137/0402008

R. M. Karp, On the computational complexity of combinatorial problems, Networks, vol.5, issue.1, pp.45-68, 1975.

P. J. Looges and S. Olariu, Optimal greedy algorithms for indifference graphs, Proceedings IEEE Southeastcon '92, pp.15-25, 1993.
DOI : 10.1109/SECON.1992.202324