AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (243.7 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

P 5 -factors in line graphs of trees

Yuan Chen1, Chi Fan1, Pei Sun2( )
Research Center of Nonlinear Science, School of Mathematics and Statistics, Wuhan Textile University, Wuhan 430073, China
School of Mathematics, Zhengzhou University of Aeronautics, Zhengzhou 450046, China
Show Author Information

Abstract

Let A be a set of connected graphs. A graph G has an A -factor if G has a spanning subgraph H such that each component of H is isomorphic to one of the members in A . In this paper, we give a necessary and sufficient condition for the existence of P 5 -factors in line graphs of trees. Then we present an algorithm to search for a P 5 -factor in the line graph of a tree.

Keywords

path factorline graphtreealgorithm
CLC number: 05C38, 05C70

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 11 Issue 2,
February 2026
Pages 4890-4901
DOI: 10.3934/math.2026200

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Chen Y, Fan C, Sun P. P 5 -factors in line graphs of trees. AIMS Mathematics, 2026, 11(2): 4890-4901. https://doi.org/10.3934/math.2026200

155

Views

1

Downloads

0

Crossref

0

Web of Science

0

Scopus
Received: 24 December 2025
Revised: 05 February 2026
Accepted: 12 February 2026
Published: 27 February 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)