Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776819 | Discrete Mathematics | 2017 | 7 Pages |
Abstract
Tibor Gallai conjectured that the edge set of every connected graph G on n vertices can be partitioned into ânâ2â paths. Let Gk be 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 Gk on 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fábio Botler, Andrea Jiménez,