1. Akiyama, J., Chvátal, V.: A short proof of the linear arboricity for cubic graphs. Bull. Liber. Arts & Sci., NMS No. 2, 1–3 (1981)
2. Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs III: cyclic and acyclic invariants. Mathematica Slovaca 30, 405–417 (1980)
3. Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs IV: linear arboricity. Networks 11, 69–72 (1981)
4. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science 237, 123–134 (2000)
5. Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurrence optimization. In: Electronic Colloquium on Computational Complexity (2003); Report TR03-008