Open Access
Issue |
RAIRO-Oper. Res.
Volume 58, Number 5, September-October 2024
|
|
---|---|---|
Page(s) | 4521 - 4530 | |
DOI | https://doi.org/10.1051/ro/2024184 | |
Published online | 21 October 2024 |
- J. Akiyama, D. Avis and H. Era, On a {1,2}-factor of a graph. TRU Math. 16 (1980) 97–102. [Google Scholar]
- 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, The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43 (2002) 5–16. [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 and Z. Hu, P3-factors in the square of a tree. Graphs combin. 36 (2020) 1913–1925. [CrossRef] [MathSciNet] [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]
- G. Dai, Y. Hang, X. Zhang, Z. Zhang and W. Wang, 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. combin. 25 (2018) 1–40. [CrossRef] [MathSciNet] [Google Scholar]
- P. Hell and D.G. Kirkpatrick, On the completeness of a generalized matching problem. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. San Diego (1978) 240–245. [Google Scholar]
- P. Hell and D.G. Kirkpatrick, On the complexity of general graph factor problems. SIAM J. Comput. 12 (1983) 601–609. [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. Combin. Theory Ser. B 88 (2003) 195–218. [CrossRef] [MathSciNet] [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]
- K. Kawarabayashi, H. Matsuda, Y. Oda and K. Ota, Path factors in cubic graphs. J. Graph Theory 39 (2002) 188–193. [Google Scholar]
- H. Liu, Degree conditions for path-factor critical deleted or covered graphs. RAIRO Oper. Res. 57 (2023) 1443–1451. [CrossRef] [EDP Sciences] [MathSciNet] [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, Perspectives: 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. Lond. 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 a {P2, P5}-factor in a graph. RAIRO Oper. Res. 57 (2023) 2231–2237. [CrossRef] [EDP Sciences] [MathSciNet] [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]
- Q.R. Yu and G.Z. Liu, Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009). [Google Scholar]
- P. Zhang and S. Zhou, Characterizations for P≥2-factor and P≥3-factor covered graphs. Discrete Math. 309 (2009) 2067–2076. [CrossRef] [MathSciNet] [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, Z. Sun and H. Liu, Distance signless Laplacian spectral radius for the existence of path-factors in graphs. Aequationes Math. 98 (2024) 727–737. [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.