Toughness and isolated toughness conditions for path-factor critical covered graphs

Open Access

Issue		RAIRO-Oper. Res. Volume 57, Number 2, March-April 2023


Page(s)		847 - 856
DOI		https://doi.org/10.1051/ro/2023039
Published online		28 April 2023

J. Akiyama and M. Kano, Factors and factorizations of graphs-a survey. J. Graph Theory 9 (1985) 1–42. [CrossRef] [MathSciNet] [Google Scholar]
J. Akiyama, D. Avis and H. Era, On a 1,2-factor of a graph. TRU Math. 16 (1980) 97–102. [MathSciNet] [Google Scholar]
K. Ando, Y. Egawa, A. Kaneko, K.I. Kawarabayashi and H. Matsuda, Path factors in claw-free graphs. Discrete Math. 243 (2002) 195–200. [CrossRef] [MathSciNet] [Google Scholar]
C. Bazgan, A.H. Benhamdine, H. Li and M. Woźniak, Partitioning vertices of 1-tough graph into paths. Theor. Comput. Sci. 263 (2001) 255–261. [CrossRef] [Google Scholar]
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan, London (1976). [CrossRef] [Google Scholar]
V. Chvátal, Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228. [CrossRef] [MathSciNet] [Google Scholar]
G. Dai, The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43 (2023) 5–16. [Google Scholar]
G. Dai and Z. Hu, P₃-factors in the square of a tree. Graphs Combin. 36 (2020) 1913–1925. [CrossRef] [MathSciNet] [Google Scholar]
G. Dai, Z. Zhang and X. Zhang, Compoent factors in K_1,r-free graphs. Preprint arXiv:2012.06359 (2020). [Google Scholar]
Y. Egawa and M. Furuya, The existence of a path-factor without small odd paths. Electron. J. Comb. 25 (2018) 1–40. [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. Combin. Theory Ser. B 88 (2003) 195–218. [CrossRef] [MathSciNet] [Google Scholar]
A. Kaneko, A. Kelmans and T. Nishimura, On packing 3-vertex paths in a graph. J. Graph Theory 36 (2001) 175–197. [CrossRef] [MathSciNet] [Google Scholar]
M. Kano, G.Y. Katona and Z. Király, Packing paths of length at least two. Discrete Math. 283 (2004) 129–135. [Google Scholar]
M. Kano, C. Lee and K. Suzuki, Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28 (2008) 551–556. [Google Scholar]
K. Kawarabayashi, H. Matsuda, Y. Oda and K. Ota, Path factors in cubic graphs. J. Graph Theory 39 (2002) 188–193. [Google Scholar]
M.D. Plummer, Perspectives: graph factors and factorization: 1985–2003: a survey. Discrete Math. 307 (2007) 791–821. [CrossRef] [MathSciNet] [Google Scholar]
W.T. Tutte, The factors of graphs. Canad. J. Math. 4 (1952) 314–328. [CrossRef] [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, Isolated toughness for path factors in networks. RAIRO: OR 56 (2022) 2613–2619. [CrossRef] [EDP Sciences] [Google Scholar]
J. Wu, Path-factor critical covered graphs and path-factor uniform graphs. RAIRO: OR 56 (2022) 4317–4325. [CrossRef] [EDP Sciences] [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, Berlin, Heidelberg Press (2009). [CrossRef] [Google Scholar]
P. Zhang and S. Zhou, Characterizations for P_≥2-factor and P_≥3-factor covered graphs. Discrete Math. 309 (2009) 2067–2076. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Degree conditions and path factors with inclusion or exclusion properties. Bull. Math. Soc. Sci. Math. Roumanie 66 (2023) 3–14. [Google Scholar]
S. Zhou, Z. Sun and H. Liu, Sun toughness and P_≥3-factors in graphs. Contrib. Discret. Math. 14 (2019) 167–174. [Google Scholar]
S. Zhou, Z. Sun and H. Liu, Some sufficient conditions for path-factor uniform graphs. Aequ. Math. (2023) 1–12. [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, J. Wu and T. Zhang, The existence of P_≥3-factor covered graphs. Discuss. Math. Graph Theory 37 (2017) 1055–1065. [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.