Open Access
Issue |
RAIRO-Oper. Res.
Volume 56, Number 5, September-October 2022
|
|
---|---|---|
Page(s) | 3675 - 3688 | |
DOI | https://doi.org/10.1051/ro/2022177 | |
Published online | 31 October 2022 |
- J.A. Bondy and U.S.R. Mutry, Graph Theory. Springer, Berlin (2008). [CrossRef] [Google Scholar]
- W. Gao and W. Wang, New isolated toughness condition for fractional (g, f, n)-critical graphs. Colloq. Math. 147 (2017) 55–66. [CrossRef] [MathSciNet] [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. Chen and Y. Zhang, Viewing the network parameters and ℋ-factors from the perspective of geometry. Int. J. Intell. Syst. 37 (2022) 6686–6728. [CrossRef] [Google Scholar]
- G. Liu and L. Zhang, Fractional (g, f)-factors of graphs. Acta Math. Sci. 21 (2001) 541–545. [CrossRef] [MathSciNet] [Google Scholar]
- G. Liu and L. Zhang, Toughness and the existence of fractional k-factors of graphs. Discrete Math. 308 (2008) 1741–1748. [CrossRef] [MathSciNet] [Google Scholar]
- Y. Ma and G. Liu, Fractional factors and isolated toughness of graphs. Math. Appl. 19 (2006) 188–194. [Google Scholar]
- J. Yang, Y. Ma and G. Liu, Fractional (g, f)-factors in graphs. Appl. Math. J. Chinese Univ. Ser. A 16 (2001) 385–390. [MathSciNet] [Google Scholar]
- S. Zhou, Remarks on restricted fractional (g, f)-factors in graphs. Discrete Appl. Math. https://doi.org/10.1016/j.dam.2022.07.020. [Google Scholar]
- L. Zhang and G. Liu, Fractional k-factor of graphs. J. Syst. Sci. Math. Sci. 21 (2001) 88–92. [Google Scholar]
- S. Zhou, H. Liu and Y. Xu, A note on fractional ID-[a, b]-factor-critical covered graphs. Discrete Appl. Math. 319 (2022) 511–516. [CrossRef] [MathSciNet] [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, J. Wu and H. Liu, Independence number and connectivity for fractional (a, b, k)- critical covered graphs. RAIRO:OR 56 (2022) 2535–2542. [CrossRef] [EDP Sciences] [Google Scholar]
- S. Zhou, J. Wu and Y. Xu, Toughness, isolated toughness and path factors in graphs. Bull. Aust. Math. Soc. 106 (2022) 195–202. [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.