Degree conditions for the existence of a {P2, P5}-factor in a graph

Open Access

Issue		RAIRO-Oper. Res. Volume 57, Number 4, July-August 2023


Page(s)		2231 - 2237
DOI		https://doi.org/10.1051/ro/2023111
Published online		18 September 2023

G. Dai, Y. Hang, X. Zhang and Z. Zhang, Sufficient conditions for graphs with {P2, P5}-factors. RAIRO: Oper. Res. 56 (2022) 2895–2901. [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) #P1.40. [CrossRef] [Google Scholar]
W. Gao and W. Wang, Tight binding number bound for P_≥3-factor uniform graphs. Inf. Process. Lett. 172 (2021). [Google Scholar]
W. Gao, W. Wang and Y. Chen, Tight bounds for the existence of path factors in network vulnerability parameter settings. Int. J. Intell. Syst. 36 (2021) 1133–1158. [Google Scholar]
X. Gu and M. Liu, A tight lower bound on the matching number of graphs via Laplacian eigenvalues. Eur. J. Comb. 101 (2022) 103468. [CrossRef] [Google Scholar]
M. Kano, H. Lu and Q. Yu, Component factors with large components in graphs. Appl. Math. Lett. 23 (2010) 385–389. [Google Scholar]
M. Kano and A. Saito, Star-factors with large component. Discrete Math. 312 (2012) 2005–2008. [Google Scholar]
S. Kim, O. Suil, J. Park and H. Ree, An odd [1, 6]-factor in regular graphs from eigenvalues. Discrete Math. 343 (2020) 111906. [CrossRef] [MathSciNet] [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, On k-orthogonal factorizations in networks. RAIRO: Oper. Res. 55 (2021) 969–977. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, Research on fractional critical covered graphs. Probl. Inf. Transm. 56 (2020) 270–277. [CrossRef] [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, Remarks on fractional ID-[a, 6]-factor-critical covered network graphs. Proc. Roman. Acad. Ser. A: Math. Phys. Tech. Sci. Inf. Sci. 22 (2021) 209–216. [Google Scholar]
J. Wu, Path-factor critical covered graphs and path-factor uniform graphs. RAIRO: Oper. Res. 56 (2022) 4317–4325. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
Y. Yuan and R. Hao, Independence number, connectivity and all fractional (a, 6, fc)-critical graphs. Discuss. Math. Graph Theory 39 (2019) 183–190. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, A neighborhood union condition for fractional (a, 6, fc)-critical covered graphs. Discrete Appl. Math. 323 (2022) 343–348. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, A note of generalization of fractional ID-factor-critical graphs. Fundam. Inf. 187 (2022) 61–69. [Google Scholar]
S. Zhou, Degree conditions and path factors with inclusion or exclusion properties. Bull. Math. Soc. Sci. Math. Roumanie 66 (2023) 3–14. [Google Scholar]
S. Zhou, Some results on path-factor critical avoidable graphs. Discuss. Math. Graph Theory 43 (2023) 233–244. [Google Scholar]
S. Zhou and Q. Bian, The existence of path-factor uniform graphs with large connectivity. RAIRO: Oper. Res. 56 (2022) 2919–2927. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
S. Zhou and H. Liu, Two sufficient conditions for odd [1, 6]-factors in graphs. Linear Algebra Appl. 661 (2023) 149–162. [CrossRef] [MathSciNet] [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, H. Liu and Y. Xu, A note on fractional ID-[a, 6]-factor-critical covered graphs. Discrete Appl. Math. 319 (2022) 511–516. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, J. Wu and Q. Bian, On path-factor critical deleted (or covered) graphs. Aequationes Mathematicae 96 (2022) 795–802. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, J. Wu and H. Liu, Independence number and connectivity for fractional (a, 6, fc)-critical covered graphs. RAIRO: Oper. Res. 56 (2022) 2535–2542. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
S. Zhou, J. Wu and Y. Xu, Toughness, isolated toughness and path factors in graphs. Bull. Aust. Math. Soc. 106 (2022) 195–202. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Q. Bian and Z. Sun, Two sufficient conditions for component factors in graphs. Discuss. Math. Graph Theory 43 (2023) 761–766. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Z. Sun and H. Liu, Some sufficient conditions for path-factor uniform graphs. Aequationes Mathematicae 97 (2023) 489–500. [CrossRef] [MathSciNet] [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.