Indexed by：
Abstract：
Let G be a 2k-regular graph in which every cycle of length at most k is an induced cycle. In this paper, we prove that G can be decomposed into paths of length k, and moreover, every vertex is a terminal of exactly two paths.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
GRAPHS AND COMBINATORICS
ISSN： 0911-0119
Year： 2022
Issue： 5
Volume： 38
0 . 7
JCR@2022
0 . 6 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：24
JCR Journal Grade：3
CAS Journal Grade：4
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
