1. The cycling property for the clutter of odd st-walks;Abdi;IPCO Lecture Notes in Comput. Sci.,2014
2. A. Abdi, B. Guenin, Packing odd T-joins with at most two terminals. Manuscript, 2014, p. 98. arxiv.org/abs/1410.7423.
3. M. Chudnovsky, K. Edwards, K. Kawarabayashi, P.D. Seymour, Edge-colouring seven-regular planar graphs. Manuscript, 2012. arXiv:1009.5912.
4. M. Chudnovsky, K. Edwards, P.D. Seymour, Edge-colouring eight-regular planar graphs. Manuscript, 2012 arXiv:1209.1176.
5. J. Cohen, C. Lucchesi, Minimax relations for T -join packing problems, in: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, ISTCS 97, 1997, pp. 38–44.