| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777066 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
A Pâ-decomposition of a graph G is a set of edge-disjoint copies of Pâ in G that cover the edge set of G, where Pâ is the path with â edges. Kouider and Lonc [M. Kouider, Z. Lonc, Path decompositions and perfect path double covers, Australas. J. Combin. 19 (1999) 261-274] conjectured that any 2â-regular graph G admits a Pâ-decomposition D where every vertex of G is the end-vertex of exactly two paths of D. In this paper we verify Kouider and Lonc's Conjecture for paths of length 4.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fábio Botler, Alexandre Talon,