Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices

Open Access

Issue		RAIRO-Oper. Res. Volume 59, Number 6, November-December 2025


Page(s)		3675 - 3681
DOI		https://doi.org/10.1051/ro/2025148
Published online		10 December 2025

J. Akiyama and M. Kano, Factors and factorizations of graphs – a survey. J. Graph Theory 9 (1985) 1–42. [Google Scholar]
K. Ando, Y. Egawa, A. Kaneko, K.I. Kawarabayashi and H. Matsuda, Path factors in claw-free graphs. Discrete Math. 243 (2002) 195–200. [CrossRef] [MathSciNet] [Google Scholar]
G. Dai, Remarks on component factors in graphs. RAIRO Oper. Res. 56 (2022) 721–730. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
G. Dai, The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43 (2023) 5–16. [Google Scholar]
G. Dai, Degree sum conditions for path-factor uniform graphs. Indian J. Pure Appl. Math. 55 (2024) 1409–1415. [Google Scholar]
G. Dai and Z. Hu, P₃-factors in the square of a tree. Graphs Comb. 36 (2020) 1913–1925. [CrossRef] [Google Scholar]
G. Dai, Z. Zhang, Y. Hang and X. Zhang, Some degree conditions for P_≥3-factor covered graphs. RAIRO Oper. Res. 55 (2021) 2907–2913. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
Y. Egawa and M. Furuya, The existence of a path-factor without small odd paths. Electron. J. Comb. 25 (2018) 1–40. [Google Scholar]
W. Gao and W. Wang, Tight binding number bound for P_≥3-factor uniform graphs. Inform. Process. Lett. 172 (2021) 106162. [Google Scholar]
H. Hua, Toughness and isolated toughness conditions for P_≥3-factor uniform graphs. J. Appl. Math. Comput. 66 (2021) 809–821. [CrossRef] [MathSciNet] [Google Scholar]
A. Kaneko, A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Comb. Theory Ser. B 88 (2003) 195–218. [Google Scholar]
A. Kaneko, A. Kelmans and T. Nishimura, On packing 3-vertex paths in a graph. J. Graph Theory 36 (2001) 175–197. [CrossRef] [MathSciNet] [Google Scholar]
M. Kano, G.Y. Katona and Z. Király, Packing paths of length at least two. Discrete Math. 283 (2004) 129–135. [Google Scholar]
K. Kawarabayashi, H. Matsuda, Y. Oda and K. Ota, Path factors in cubic graphs. J. Graph Theory 39 (2002) 188–193. [Google Scholar]
S. Li and S. Miao, Characterizing P_≥2-factor and P_≥2-factor covered graphs with respect to the size or the spectral radius. Discrete Math. 344 (2021) 112588. [Google Scholar]
H. Liu and X. Pan, Independence number and minimum degree for path-factor critical uniform graphs. Discrete Appl. Math. 359 (2024) 153–158. [CrossRef] [MathSciNet] [Google Scholar]
M.D. Plummer, Graph factors and factorization: 1985–2003: a survey. Discrete Math. 307 (2007) 791–821. [CrossRef] [MathSciNet] [Google Scholar]
W.T. Tutte, The factorization of linear graphs. J. London Math. Soc. 22 (1947) 107–111. [CrossRef] [Google Scholar]
S. Wang and W. Zhang, Isolated toughness for path factors in networks. RAIRO Oper. Res. 56 (2022) 2613–2619. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, Degree conditions for the existence of {P₂, P₅}-factor in a graph. RAIRO Oper. Res. 57 (2023) 2231–2237. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
D.R. Woodall, The binding number of a graph and its Anderson number. J. Comb. Theory Ser. B 15 (1973) 225–255. [CrossRef] [Google Scholar]
Q. Yu and G. Liu, Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009). [Google Scholar]
H. Zhang and S. Zhou, Characterizations for P_≥2-factor and P_≥3-factor covered graphs. Discrete Math. 309 (2009) 2067–2076. [Google Scholar]
H. Zhang and S. Zhou, A note on path factors in claw-free graphs. ARS Comb. 97 (2010) 87–95. [Google Scholar]
P. Zhang, Degree conditions for path-factors in graphs. RAIRO Oper. Res. 58 (2024) 4521–4530. [Google Scholar]
P. Zhang, Binding number conditions for path-factor uniform graphs. Bull. Malays. Math. Sci. Soc. 48 (2025) 124. [Google Scholar]
S. Zhou, Some spectral conditions for path-factors in bipartite graphs. Discrete Appl. Math. 369 (2025) 124–130. [Google Scholar]
S. Zhou, Q. Bian and Q. Pan, Path factors in subgraphs. Discrete Appl. Math. 319 (2022) 183–191. [CrossRef] [Google Scholar]
S. Zhou and Z. Sun, Binding number conditions for P_≥2-factor and P_≥3-factor uniform graphs. Discrete Math. 343 (2020) 111715. [Google Scholar]
S. Zhou, Z. Sun and H. Liu, Some sufficient conditions for path-factor uniform graphs. Aequationes Math. 97 (2023) 489–500. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Y. Zhang and Z. Sun, The A_α-spectral radius for path-factors in graphs. Discrete Math. 347 (2024) 113940. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.