Open Access
| Issue |
RAIRO-Oper. Res.
Volume 59, Number 4, July-August 2025
|
|
|---|---|---|
| Page(s) | 2241 - 2255 | |
| DOI | https://doi.org/10.1051/ro/2025093 | |
| Published online | 05 September 2025 | |
- G. Ao, R. Liu and J. Yuan, Sufficient conditions for k-factor-critical graphs and spanning k-trees of graphs. J. Algebraic Comb. 61 (2025) 1–12. [Google Scholar]
- A.E. Brouwer and W.H. Haemers, Spectra of Graphs. Springer, New York (2012). [Google Scholar]
- J. Bondy and U. Murty, Graph Theory with Applications. Macmillan, London (1976). [Google Scholar]
- B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60–67. [Google Scholar]
- V. Chvátal, Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228. [CrossRef] [MathSciNet] [Google Scholar]
- D. Fan, S. Goryainov, X. Huang and H. Lin, The spanning k-trees, perfect matchings and spectral radius of graphs. Linear Multilinear Algebra 70 (2022) 7264–7275. [Google Scholar]
- O. Favaron, On k-factor-critical graphs. Discuss. Math. Graph Theory 16 (1996) 41–51. [Google Scholar]
- X. Gu and W. Haemers, Graph toughness from Laplacian eigenvalues. Algebr. Comb. 5 (2022) 53–61. [Google Scholar]
- X. Gu and M. Liu, A tight lower bound on the matching number of graphs via Laplacian eigenvalues. European J. Comb. 101 (2022) 103468. [Google Scholar]
- J. Guo and H. Zhang, Minimally k-factor-critical graphs for some large k. Graphs Comb. 39 (2023) 1–18. [Google Scholar]
- L. Lovász, The factorization of graphs. II. Acta Math. Hungar. 23 (1972) 223–246. [Google Scholar]
- T. Ma, E.R. Dam and L. Wang, Spectral condition for k-factor-criticality in t-connected graphs. Preprint arXiv:2503.22951 (2025) [Google Scholar]
- S. Miao, S. Li and W. Wei, Matching extension and matching exclusion via the size or the spectral radius of graphs. Discrete Appl. Math. 347 (2024) 214–230. [Google Scholar]
- M.D. Plummer and A. Saito, Closure and factor-critical graphs. Discrete Math. 215 (2000) 171–179. [Google Scholar]
- Q. Yu and G. Liu, Graph Factors and Matching Extensions. Springer, Heidelberg (2010). [Google Scholar]
- W. Zhang, Matching extendability and connectivity of regular graphs from eigenvalues. Graphs Comb. 36 (2020) 93–108. [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.