Name
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.disc.2020.112212 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Path, Decomposition, Gallai's conjecture | Journal | 344 |
Issue | ISSN | Citations |
2 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanan Chu | 1 | 0 | 0.68 |
| Genghua Fan | 2 | 412 | 65.22 |
| Qinghai Liu | 3 | 1 | 1.05 |