Open Access
Issue |
RAIRO-Oper. Res.
Volume 59, Number 1, January-February 2025
|
|
---|---|---|
Page(s) | 391 - 396 | |
DOI | https://doi.org/10.1051/ro/2024237 | |
Published online | 04 February 2025 |
- A. Amahashi, On factors with all degrees odd. Graphs Comb. 1 (1985) 111–114. [CrossRef] [Google Scholar]
- K. Ando, A. Kaneko and T. Nishimura, A degree condition for the existence of 1-factors in graphs or their complements. Discrete Math. 203 (1999) 1–8. [CrossRef] [MathSciNet] [Google Scholar]
- A. Brouwer and W. Haemers, Eigenvalues and perfect matchings. Linear Algebra App. 395 (2005) 155–162. [CrossRef] [Google Scholar]
- C. Bujtás, S. Jendrol’ and Z. Tuza, On specific factors in graphs. Graphs Comb. 36 (2020) 1391–1399. [CrossRef] [Google Scholar]
- Y. Cui and M. Kano, Some results on odd factors of graphs. J. Graph Theory 12 (1988) 327–333. [CrossRef] [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, 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]
- W. Gao, W. Wang and Y. Chen, Tight isolated toughness bound for fractional (k, n)-critical graphs. Discrete Appl. Math. 322 (2022) 194–202. [CrossRef] [MathSciNet] [Google Scholar]
- W. Haemers, Interlacing eigenvalues and graphs. Linear Algebra App. 227 (1995) 593–616. [CrossRef] [Google Scholar]
- M. Kano and G. Katona, Odd subgraphs and matchings. Discrete Math. 250 (2002) 265–272. [CrossRef] [MathSciNet] [Google Scholar]
- P. Katerinis, Toughness of graphs and the existence of factors. Discrete Math. 80 (1990) 81–92. [CrossRef] [MathSciNet] [Google Scholar]
- H. Liu, On path-factor critical uniform graphs. Indian J. Pure Appl. Math. 55 (2024) 1222–1230. [CrossRef] [MathSciNet] [Google Scholar]
- H. Liu and H. Lu, A degree condition for a graph to have (a, b)-parity factors. Discrete Math. 341 (2018) 244–252. [CrossRef] [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]
- H. Lu, Z. Wu and X. Yang, Eigenvalues and [1, n]-odd factors. Linear Algebra App. 433 (2010) 750–757. [CrossRef] [Google Scholar]
- H. Lu, Z. Yang and X. Zhang, A characterization for graphs having strong parity factors. Graphs Comb. 37 (2021) 945–949. [CrossRef] [Google Scholar]
- X. Lv, A degree condition for graphs being fractional (a, b, k)-critical covered. Filomat 37 (2023) 3315–3320. [MathSciNet] [Google Scholar]
- X. Lv, An improvement of the previous result on fractional (a, b, k)-critical covered graphs. Indian J. Pure Appl. Math. 55 (2024) 40–46. [CrossRef] [MathSciNet] [Google Scholar]
- H. Matsuda, Fan-type results for the existence of [a, b]-factors. Discrete Math. 306 (2006) 688–693. [CrossRef] [MathSciNet] [Google Scholar]
- W. Tutte, The factorizations of linear graphs. J. London Math. Soc. 22 (1947) 107–111. [CrossRef] [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]
- Z. Yang, X. Zhang, H. Lu and Y. Lin, Sufficient conditions for a graph to have all [a, b]-factors and (a, b)-parity factors. Bull. Malaysian Math. Sci. Soc. 45 (2022) 1657–1667. [CrossRef] [MathSciNet] [Google Scholar]
- Q. Zhang and D. Fan, Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs. Linear Algebra App. 701 (2024) 97–111. [CrossRef] [Google Scholar]
- S. Zhou, A neighborhood union condition for fractional (a, b, k)-critical covered graphs. Discrete Appl. Math. 323 (2022) 343–348. [CrossRef] [MathSciNet] [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 H. Liu, Two sufficient conditions for odd [1, b]-factors in graphs. Linear Algebra App. 661 (2023) 149–162. [CrossRef] [Google Scholar]
- S. Zhou and H. Liu, Star-factors with large components, fractional k-extendability and spectral radius in graphs. Discrete Appl. Math. 361 (2025) 402–411. [CrossRef] [MathSciNet] [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, J. Wu and Q. Bian, On path-factor critical deleted (or covered) graphs. Aequ. Math. 96 (2022) 795–802. [CrossRef] [Google Scholar]
- S. Zhou, Q. Pan and L. Xu, Isolated toughness for fractional (2, b, k)-critical covered graphs. Proc. Roman. Acad. Ser. A: Math. Phys. Tech. Sci. Inf. Sci. 24 (2023) 11–18. [CrossRef] [MathSciNet] [Google Scholar]
- S. Zhou, Z. Sun and H. Liu, Some sufficient conditions for path-factor uniform graphs. Aequ. Math. 97 (2023) 489–500. [CrossRef] [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, 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 Q. Bian, A spectral condition for a graph to have strong parity factors. Discrete Appl. Math. 360 (2025) 188–195. [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.