Abstract
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is isomorphic to P2 or P5, where Pk denotes the path of order k. It was proved by Egawa and Furuya that if G satisfies 3c1 (G − S) + 2c3 (G − S) ≤ 4|S| + 1 for all S ⊆ V(G), then G has a {P2, P5}-factor, where ck (G − S) denotes the number of components of G − S with order k. By this result, we give some other sufficient conditions for a graph to have a {P2, P5}-factor by various graphic parameters such as toughness, binding number, degree sums, etc. Moreover, we obtain some regular graphs and some K(1,r)-free graphs having {P2, P5}-factors.
Funder
National Natural Science Foundation of China
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference23 articles.
1. Factors and factorizations of graphs—a survey
2. Path factors in claw-free graphs
3. Bondy J.A. and Murty U.S.R., Graph Theory with Applications. North-Holland, New York-Amsterdam-Oxford (1982).
4. Tough graphs and hamiltonian circuits
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On graph-based network parameters and component factors in networks;RAIRO - Operations Research;2024-07
2. Tight toughness bounds for path-factor critical avoidable graphs;AKCE International Journal of Graphs and Combinatorics;2024-02-26
3. Degree conditions for the existence of a {P2, P5}-factor in a graph;RAIRO - Operations Research;2023-07
4. Degree sum and restricted {P2,P5}-factor in graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-06-28
5. Degree sum conditions for path-factor uniform graphs;Indian Journal of Pure and Applied Mathematics;2023-06-19