Degree conditions for path-factor critical deleted or covered graphs

Open Access

Issue		RAIRO-Oper. Res. Volume 57, Number 3, May-June 2023


Page(s)		1443 - 1451
DOI		https://doi.org/10.1051/ro/2023078
Published online		21 June 2023

K. Ando, Y. Egawa, A. Kaneko, K. Kawarabayashi and H. Matsuda, Path factors in claw-free graphs. Discrete Math. 243 (2002) 195–200. [Google Scholar]
C. Bazgan, A.H. Benhamdine, H. Li and M. Wozniak, Partitioning vertices of 1-tough graph into paths. Theor. Comput. Sci. 263 (2001) 255–261. [CrossRef] [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 Ser. B 88 (2003) 195–218. [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]
M. Kano, H. Lu and Q. Yu, Component factors with large components in graphs. Appl. Math. Lett. 23 (2010) 385–389. [Google Scholar]
H. Liu, Sun toughness and path-factor uniform graphs. RAIRO: OR 56 (2022) 4057–4062. [CrossRef] [EDP Sciences] [Google Scholar]
M. Plummer and A. Saito, Toughness, binding number and restricted matching extension in a graph. Discrete Math. 340 (2017) 2665–2672. [Google Scholar]
S. Wang and W. Zhang, Research on ractional critical covered graphs. Probl. Inf. Transm. 56 (2020) 270–277. [CrossRef] [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, On k-orthogonal factorizations in networks. RAIRO: OR 55 (2021) 969–977. [CrossRef] [EDP Sciences] [Google Scholar]
S. Wang and W. Zhang, Independence number, minimum degree and path-factors in graphs, Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 23 (2022) 229–234. [MathSciNet] [Google Scholar]
S. Wang, W. Zhang, Isolated toughness for path factors in network. 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]
H. Zhang and S. Zhou, Characterizations for P_≥2-factor and P_≥3-factor covered graphs. Discrete Math. 309 (2009) 2067–2076. [Google Scholar]
S. Zhou, A note of generalization of fractional ID-factor-critical graphs. Fundam. Inform. 187 (2022) 61–69. [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, Remarks on restricted fractional (g, f)-factors in graphs. Discrete Appl. Math. (2022). DOI: 10.1016/j.dam.2022.07.020. [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, Path factors and neighborhoods of independent sets in graphs. Acta Math. Appl. Sin. Engl. Ser. 39 (2023) 232–238. [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 Q. Bian, The existence of path-factor uniform graphs with large connectivity. RAIRO: OR 56 (2022) 2919–2927. [CrossRef] [EDP Sciences] [Google Scholar]
S. Zhou and H. Liu, Two sufficient conditions for odd [1, b]-factors in graphs. Linear Algebra Appl. 661 (2023) 149–162. [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]
S. Zhou, Q. Bian and Q. Pan, Path factors in subgraphs. Discrete Appl. Math. 319 (2022) 183–191. [CrossRef] [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]

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.