Open Access
RAIRO-Oper. Res.
Volume 57, Number 3, May-June 2023
Page(s) 1167 - 1177
Published online 18 May 2023
  • I. Anderson, Perfect matchings of a graph. J. Graph Theory 10 (1971) 183–186. [Google Scholar]
  • S. Abdullah and M. Aslam, New multicriteria group decision support systems for small hydropower plant locations selection based on intuitionistic cubic fuzzy aggregation information. Int. J. Intell. Syst. 35 (2020) 983–1020. [Google Scholar]
  • C. Chen, K.M. Koh and Y. Peng, On the higher-order edge toughness of a graph. Discrete Math. 111 (1993) 113–123. [CrossRef] [MathSciNet] [Google Scholar]
  • F. Chiclana, F. Mata, L. Pérez and E. Herrera-Viedma, Type-1 OWA unbalanced fuzzy linguistic aggregation methodology: application to eurobonds credit risk evaluation. Int. J. Intell. Syst. 33 (2018) 1071–1088. [Google Scholar]
  • V. Chvátal, Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228. [CrossRef] [MathSciNet] [Google Scholar]
  • Y. Egawa, M. Furuya and K. Ozeki, Sufficient conditions for the existence of a path-factor which are related to odd components. J. Graph Theory. 89 (2018) 327–340. [CrossRef] [MathSciNet] [Google Scholar]
  • W. Gao and Y. Gao, Toughness condition for a graph to be a fractional (g, f, n)-critical deleted graph. Sci. World J. (2014) 369–798. [Google Scholar]
  • W. Gao and W.F. Wang, Remarks on component factors. J. Oper. Res. Soc. China (2021) 1–11. [Google Scholar]
  • W. Gao, W.F. Wang and Y.J. Chen, Tight bounds for the existence of path factors in network vulnerability parameter settings. Int. J. Intell. Syst. 36 (2021) 1133–1158. [CrossRef] [Google Scholar]
  • X. Guan, T. Ma and C. Shi, Tight toughness, isolated toughness and binding number bounds for the {K2, Cn}-factors. Preprint arXiv:2204.04373 (2022). [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]
  • C. Liu and L. Zhang, Toughness and the existence of fractional k-factors of graphs. Discrete Math. 308 (2008) 1741–1748. [CrossRef] [MathSciNet] [Google Scholar]
  • D. Woodall, The binding number of a graph and its Anderson number. J. Graph Theory B 15 (1973) 225–255. [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]
  • Q. Yu and G. Liu, Graph Factors and Matching Extensions, Springer-Verlag, Berlin (2009) xii+353.. [Google Scholar]
  • L. Zhang and G. Liu, Fractional k-factor of graphs. J. Syst. Sci. Math. Sci. 21 (2001) 88–92. [Google Scholar]
  • Y. Zhang, G. Yan and M. Kano, Star-like factors with large components. J. Oper. Res. Soc. China 3 (2015) 81–88. [CrossRef] [MathSciNet] [Google Scholar]
  • S. Zhou, Z. Sun and H. Liu, Isolated toughness and path-factor uniform graphs. RAIRO: OR 55 (2021) 1279–1290. [CrossRef] [EDP Sciences] [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 Y. Xu, Toughness, isolated toughness and path factors in graphs. Bull. Aust. Math. Soc. 106 (2022) 195–202. [CrossRef] [MathSciNet] [Google Scholar]
  • S. Zhou, Q. Bian and Q. Pan, Path factors in subgraphs. Discrete Appl. Math. 319 (2022) 183–191. [CrossRef] [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.