Fábio BotlerJiménez, AndreaAndreaJiménez2025-12-062025-12-062016-11-1910.1016/j.disc.2016.09.0292-s2.0-85028279544https://cris-uv-2.scimago.es/handle/123456789/7116WOS:000398751100028Tibor Gallai conjectured that the edge set of every connected graph G on n vertices can be partitioned into ⌈n∕2⌉ paths. Let Gkbe the class of all 2k-regular graphs of girth at least 2k−2 that admit a pair of disjoint perfect matchings. In this work, we show that Gallai's conjecture holds in Gk, for every k≥3. Further, we prove that for every graph G in Gkon n vertices, there exists a partition of its edge set into n∕2 paths of lengths in {2k−1,2k,2k+1} and cycles of length 2k.lvacceso restringidoDiscrete Mathematics And CombinatoricsMathematicsTheoretical Computer Sciencearticle