Open Access
Issue |
RAIRO-Oper. Res.
Volume 58, Number 5, September-October 2024
|
|
---|---|---|
Page(s) | 3849 - 3858 | |
DOI | https://doi.org/10.1051/ro/2024170 | |
Published online | 24 September 2024 |
- J. Akiyama and M. Kano, Factors and Factorizations of Graphs. Springer, Berlin, Lecture Notes in Mathematics, 2031 (2011) 1–347. [Google Scholar]
- J. Akiyama, D. Avis and H. Era, On a {1, 2}-factor of a graph. TRU Math. 16 (1980) 97–102. [Google Scholar]
- A. Amahashi and M. Kano, On factors with given components. Discrete Math. 42 (1982) 1–6. [Google Scholar]
- J.A. Bondy and U.S.R. Murty, Graph Theory. Springer (2008). [CrossRef] [Google Scholar]
- G. Dai, Degree sum and restricted {P2, P5}-factor in graphs. Proc. Romanian Acad. Ser. A 24 (2023) 105–111. [Google Scholar]
- G. Dai, Degree sum conditions for path-factor uniform graphs. Indian J. Pure Appl. Math. (2023) DOI: https://doi.org/10.1007/s13226-023-00446-7 [Google Scholar]
- G. Dai, The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43 (2023) 5–16. [Google Scholar]
- G. Dai and Z. Hu, P3-factors in the square of a tree. Graphs Comb. 36 (2020) 1913–1925. [Google Scholar]
- G. Dai, Z. Zhang, Y. Hang and X. Zhang, Some degree conditions for P≥k-factor covered graphs. RAIRO:RO 55 (2021) 2907–2913. [Google Scholar]
- G. Dai, Y. Hang, X. Zhang, Z. Zhang and W. Wang, Sufficient conditions for graphs with {P2, P5}-factor. RAIRO:RO 56 (2022) 2895–2901. [Google Scholar]
- Y. Egawa, M. Kano and Z. Yan, Star-cycle factors of graphs. Discuss. Math. Graph Theory 34 (2014) 193–198. [CrossRef] [MathSciNet] [Google Scholar]
- W. Gao and W. Wang, Remarks on component factors. J. Oper. Res. Soc. China 11 (2023) 657–666. [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]
- M. Kano and A. Saito, Star-factors with large components. Discrete Math. 312 (2012) 2005–2008. [CrossRef] [MathSciNet] [Google Scholar]
- M. Kano, G.Y. Katona and Z.Z. Király, Packing paths of length at least two. Discrete Math. 283 (2004) 129–135. [CrossRef] [MathSciNet] [Google Scholar]
- M. Kano, C. Lee and K. Suzuki, Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28 (2008) 551–556. [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, H. Lu and Q. Yu, Fractional factors, component factors and isolated vertex conditions in graphs. Electron. J. Comb. 26 (2019) DOI: https://doi.org/10.37236/8498 [Google Scholar]
- A. Klopp and E. Steffen, Fractional matchings, component-factors and edge-chromatic critical graphs. Graphs Comb. 37 (2021) 559–580. [CrossRef] [Google Scholar]
- H. Liu, Binding number for path-factor uniform graphs. Proc. Romanian Acad. ser. A 23 (2022) 25–32. [Google Scholar]
- O. Ore, Notes on Hamilton circuits. Am. Math. Mon. 67 (1960) 55. [CrossRef] [Google Scholar]
- W.T. Tutte, The factors of graphs. Can. J. Math. 4 (1952) 314–328. [Google Scholar]
- W.T. Tutte, The 1-factors of oriented graphs. Proc. Am. Math. Soc. 4 (1953) 922–931. [CrossRef] [Google Scholar]
- Q. Yu and G. Liu, Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009). [CrossRef] [Google Scholar]
- P. Zhang and S. Zhou, Characterizations for P≥2-factor and P≥3-factor covered graphs. Discrete Math. 309 (2009) 2067–2076. [Google Scholar]
- S. Zhou, Some results about component factors in graphs. RAIRO:RO 53 (2019) 723–730. [CrossRef] [EDP Sciences] [Google Scholar]
- S. Zhou, J. Wu and T. Zhang, The existence of P≥3-factor covered graphs. Discuss. Math. Graph Theory 37 (2017) 1055–1065. [Google Scholar]
- S. Zhou, Z. Sun and H. Liu, Sun toughness and P≥3-factors in graphs. Contrib. Discrete Math. 14 (2019) 167–174. [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.