1. F. Abdolhosseini, S. Akbari, H. Hashemi, M. S. Moradian, 2016. Hoffmann-Ostenhof's conjecture for traceable cubic graphs.
2. Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs;Aboomahigir;Discrete Applied Mathematics,2021
3. Automated testing and interactive construction of unavoidable sets for graph classes of small path-width;Bachtler;Journal of Graph Theory Early View,2023
4. Towards obtaining a 3-decomposition from a perfect matching;Bachtler;The Electronic Journal of Combinatorics,2022
5. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoretical Computer Science,1998