Tight toughness, isolated toughness and binding number bounds for (𝒜, n)-critical deleted graphs

Open Access

Issue		RAIRO-Oper. Res. Volume 60, Number 1, January-February 2026


Page(s)		259 - 268
DOI		https://doi.org/10.1051/ro/2025169
Published online		25 February 2026

J. Akiyama, D. Avis and H. Era, On a {1,2}-factor of a graph. TRU Math. 16 (1980) 97–102. [Google Scholar]
Y. Chen and G.W. Dai, Binding number and path-factor critical deleted graphs. AKCE Int. J. Graphs. Comb. 19 (2022) 197–200. [Google Scholar]
V. Chvátal, Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228. [CrossRef] [MathSciNet] [Google Scholar]
G. Cornuéjols and W.R. Pulleyblank, Perfect triangle-free 2-matchings. Math. Program. Stud. 13 (1980) 1–7. [Google Scholar]
W. Gao and W.F. Wang, Remarks on component factors. J. Oper. Res. Soc. Chin. 11 (2023) 657–666. [Google Scholar]
X.X. Guan, T.L. Ma and C. Shi, Tight toughness, isolated toughness and binding number bounds for the {K₂,C_n}- factors. J. Oper. Res. Soc. Chin. (2023) 1–10. [Google Scholar]
A. Kaneko, A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Comb. Theory. Series. B 88 (2003) 195–218. [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]
H.X. Liu and X.G. Pan, Independence number and minimum degree for path-factor critical uniform graphs. Discrete Appl. Math. 359 (2024) 153–158. [CrossRef] [MathSciNet] [Google Scholar]
G.Z. Liu and L.J. 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, Isolated toughness and existence of fractional factors in graphs. Acta Math. Appl. Sin. Engl. Ser. 26 (2003) 133–140. [Google Scholar]
E. Scheinerman and D. Ullman, Fractional Graph Theory: A Rational Approach to the Theory of Graphs. John Wiley, New York (1997). [Google Scholar]
H. Wang, Path factors of bipartite graphs. J. Graph. Theor. 18 (1994) 161–167. [Google Scholar]
S.F. Wang and W. Zhang, Some results on star-factor deleted graphs. Filomat 38 (2024) 1101–1107. [MathSciNet] [Google Scholar]
D.R. Woodall, The binding number of a graph and its Anderson number. J. Comb. Theory. B 15 (1973) 225–255. [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. Yang, Y. Ma and G. Liu, Fractional (g, f)-factors of graphs. Appl. Math. J. Chin. Univ. Ser. A 16 (2001) 385–390. [Google Scholar]
S.Z. Zhou, Some results about component factors in graphs. RAIRO-Oper. Res. 53 (2019) 723–730. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
S.Z. Zhou, Some spectral conditions for star-factors in bipartite graphs. Discrete Appl. Math. 369 (2025) 124–130. [Google Scholar]
S.Z. Zhou, Q.X. Bian and Q.R. Pan, Path factors in subgraphs. Discrete Appl. Math. 319 (2022) 183–191. [CrossRef] [Google Scholar]
S.Z. Zhou, Z.R. Sun and H.X. Liu, On P_≥3-factor deleted graphs. Acta Math. App. Sinica Engl. Ser. 38 (2022) 178–186. [Google Scholar]
S.Z. Zhou, Z.R. Sun and Y.L. Zhang, Spectral radius and k-factor-critical graphs. J. Supercomput. 81 (2025) 456. [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.