1 paper · 1 filter
Tereza Klimošová, Stéphan Thomassé
We show that for every l, there exists d_l such that every 3-edge-connected graph with minimum degree d_l can be edge-partitioned into paths of length l (provided that its number o…