1. Akiyama, J., Chvátal, V.: A short proof of the linear arboricity for cubic graphs. Bull. Liberal Arts Sci. Nippon Med. Sch. 2, 1–3 (1981)
2. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1–2), 123–134 (2000)
3. Bermond, J.-C., Fouquet, J.L., Habib, M., Péroche, B.: On linear
$$k$$
-arboricity. Discrete Math. 52, 123–132 (1984)
4. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
5. Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks, 55(3), 205–220 (2010)