Indexed by：
Abstract：
Gallai＇s conjecture asserts that a connected graph G on n vertices can be decomposed into [n/2] paths. In this paper, we prove that a connected graph with maximum degree 6, in which the vertices of degree 6 form an independent set, can be decomposed into n/2 paths, unless it is K-3, K-5 and K-5(-). (C) 2020 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Source ：
DISCRETE MATHEMATICS
ISSN： 0012-365X
Year： 2021
Issue： 2
Volume： 344
0 . 9 6 1
JCR@2021
0 . 7 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：36
JCR Journal Grade：3
CAS Journal Grade：4
Cited Count：
WoS CC Cited Count： 3
SCOPUS Cited Count： 5
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
