EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 / No 5 (September-October 2025) RAIRO-Oper. Res., 59 5 (2025) 3241-3252 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 5, September-October 2025
Page(s) 3241 - 3252
DOI https://doi.org/10.1051/ro/2025127
Published online 31 October 2025
  • A. Amahashi and M. Kano, On factors with given components. Discrete Math. 42 (1982) 1–6. [Google Scholar]
  • W. Gao, Y. Chen and Y. Wang, Network vulnerability parameter and results on two surfaces. Int. J. Intell. Syst. 36 (2021) 4392–4414. [CrossRef] [Google Scholar]
  • W. Gao, Y. Wang and W. Wang, A sufficient condition for a graph to be fractional (k, n)-critical. Discrete Math. 347 (2024) 114008. [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 and A. Saito, Star-factors with large components. Discrete Math. 312 (2012) 2005–2008. [CrossRef] [MathSciNet] [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) #P4.33. [Google Scholar]
  • S. Kim, S. O, J. Park and H. Ree, An odd [1, b]-factor in regular graphs from eigenvalues. Discrete Math. 343 (2020) 111906. [CrossRef] [MathSciNet] [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]
  • M. Kouider and Z. Lonc, Stability number and [a, b]-factors in graphs. J. Graph Theory 46 (2004) 254–264. [CrossRef] [MathSciNet] [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]
  • X. Lv, A degree condition for graphs being fractional (a, b, k)-critical covered. Filomat 37 (2023) 3315–3320. [MathSciNet] [Google Scholar]
  • S. O, Spectral radius and matchings in graphs. Linear Algebra App. 614 (2021) 316–324. [CrossRef] [Google Scholar]
  • S. O, Eigenvalues and [a, b]-factors in regular graphs. J. Graph Theory 100 (2022) 458–469. [Google Scholar]
  • W.T. Tutte, The 1-factors of oriented graphs. Proc. Amer. Math. Soc. 4 (1953) 922–931. [Google Scholar]
  • S. Wang, Remarks on strong parity factors in graphs. Filomat 39 (2025) 4579–4583. [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]
  • J. Wu, A sufficient condition for the existence of fractional (g, f, n)-critical covered graphs. Filomat 38 (2024) 2177–2183. [MathSciNet] [Google Scholar]
  • J. Wu, Characterizing spanning trees via the size or the spectral radius of graphs. Aequ. Math. 98 (2024) 1441–1455. [CrossRef] [Google Scholar]
  • S. Zhou, Some spectral conditions for star-factors in bipartite graphs. Discrete Appl. Math. 369 (2025) 124–130. [Google Scholar]
  • S. Zhou, Toughness, fractional extendability and distance spectral radius in graphs. J. Korean Math. Soc. 62 (2025) 601–617. [Google Scholar]
  • S. Zhou and J. Wu, Spanning k-trees and distance spectral radius in graphs. J. Supercomput. 80 (2024) 23357–23366. [CrossRef] [Google Scholar]
  • S. Zhou and J. Wu, A spectral condition for the existence of component factors in graphs. Discrete Appl. Math. 376 (2025) 141–150. [Google Scholar]
  • S. Zhou and Y. Zhang, Signless Laplacian spectral radius for a k-extendable graph. Filomat 39 (2025) 649–657. [Google Scholar]
  • S. Zhou, Q. Pan and L. Xu, Isolated toughness for fractional (2, b, k)-critical covered graphs. Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 24 (2023) 11–18. [CrossRef] [MathSciNet] [Google Scholar]
  • S. Zhou, Q. Pan and Y. Xu, A new result on orthogonal factorizations in networks. Filomat 38 (2024) 7235–7244. [Google Scholar]
  • S. Zhou, Z. Sun and H. Liu, D-index and Q-index for spanning trees with leaf degree at most k in graphs. Discrete Math. 347 (2024) 113927. [CrossRef] [Google Scholar]
  • S. Zhou, Z. Sun and H. Liu, Distance signless Laplacian spectral radius for the existence of path-factors in graphs. Aequ. Math. 98 (2024) 727–737. [CrossRef] [MathSciNet] [Google Scholar]
  • S. Zhou, Y. Xu and Z. Sun, Some results about star-factors in graphs. Contrib. Discrete Math. 19 (2024) 154–162. [CrossRef] [MathSciNet] [Google Scholar]
  • S. Zhou, Y. Zhang and H. Liu, Some properties of (a, b, k)-critical graphs. Filomat 38 (2024) 5885–5894. [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]
  • S. Zhou, T. Zhang and H. Liu, Sufficient conditions for fractional k-extendable graphs. Filomat 39 (2025) 2711–2724. [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.