Indexed by：
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.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCUSSIONES MATHEMATICAE GRAPH THEORY
ISSN： 1234-3099
Year： 2022
Issue： 4
Volume： 42
Page： 1089-1097
0 . 7
JCR@2022
0 . 5 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：24
JCR Journal Grade：3
CAS Journal Grade：3
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
