Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Triangle-free Eulerian tours in graphs with maximum degree at most 4;Adelgren;Discrete Math.,1995
2. Claw-decompositions and Tutte-orientations;Barát;J. Graph Theory,2006
3. A proof of the Barát–Thomassen conjecture;Bensmail;J. Combin. Theory Ser. B,2017
4. Edge-partitioning a graph into paths: beyond the Barát–Thomassen conjecture;Bensmail;Combinatorica,2018
5. Decomposing highly edge-connected graphs into paths of any given length;Botler;J. Combin. Theory Ser. B,2017