On the linear K-arboricity of cubic graphs

References

• Akiyama , J. , Exoo , G. and Harary , F. 1980 . Covering and packing in graphs II, cyclic and acyclic invariants . Math. Slovaca , 30 : 405 – 417 .
   Google Scholar
• Bermond , J. C. , Fouquet , J. L. , Habib , M. and Peroche , B. 1984 . On linear k-arboricity . Discrete Math. , 52 : 123 – 132 .
   Google Scholar
• Brinkmann G. minibaum c. Computer Program
   Google Scholar
• Curry , H. B. 1963 . Foundations of Mathematical Logic , New York : McGraw-Hill .
   Google Scholar
• Delamarre D. Fouquet J. L. Thuillier H. Virot y. Linear k-arboricity of Cubic Graphs preprint
   Google Scholar
• Enomoto , H. and Peroche , B. 1984 . The linear arboricity of some regular graphs . J. Graph Theory , 8 : 309 – 324 .
   Google Scholar
• Guldan , F. 1986 . The linear arboricity of 10-regular graphs . Math. Slovaca , 36 : 225 – 228 .
   Google Scholar
• Habib , M. and Peroche , B. 1982 . Some problems about linear arboricity . Discrete Math. , 41 : 219 – 220 .
   Google Scholar
• Harary , F. 1970 . Covering and packing in graphs I . Ann. New York Acad. Sci. , 175 : 198 – 205 .
   Google Scholar
• Knor , M. 1994 . Note on linear arboricity . Math. Slovaca , 44 : 117 – 122 .
   Google Scholar
• Jackson , B. and Wormald , N. C. 1996 . On the linear k-arboricity of cubic graphs . Discrete Math. , 162 : 293 – 297 .
   Google Scholar
• Mc Diarmid , C. and Reed , B. 1995 . Almost every graph can be covered by [∇/2] linear forests . Combinatorics, Probability and Computing , : 257 – 268 .
   Google Scholar
• Tomasta , P. 1982 . Note on linear arboricity . Math. Slovaca , 32 : 239 – 242 .
   Google Scholar