Decomposing 10-Regular Graphs into Paths of Length 5

Abstract

Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.

Keywords

• 10-regular graph
• decomposition
• path
• 05c38
• 05c70