Remarks on component factors in K1,r-free graphs

Open Access

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


Page(s)		837 - 846
DOI		https://doi.org/10.1051/ro/2023042
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 and M. Kano, Factors and Factorizations of Graphs, in Lecture Notes in Mathematics, Vol. 2031, Springer, Berlin, (2011) 1–347. [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]
A. Amahashi and M. Kano, On factors with given components. Discrete Math. 42 (1982) 1–6. [Google Scholar]
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, NewYork-Amsterdam-Oxford (1982). [Google Scholar]
Y. Chen and G. Dai, Binding number and path-factor critical deleted graphs. AKCE Int. J. Graphs Co. 19 (2022) 197–200. [Google Scholar]
G. Dai, Remarks on component factors in graphs. RAIRO: OR 56 (2022) 721–730. [CrossRef] [EDP Sciences] [Google Scholar]
G. Dai, On 2-matching covered graphs and 2-matching deleted graphs. RAIRO: OR 56 (2022) 3667–3674. [CrossRef] [EDP Sciences] [Google Scholar]
G. Dai, The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43 (2023) 5–16. [Google Scholar]
G. Dai, Y. Hang, X. Zhang, Z. Zhang and W. Wang, Sufficient conditions for graphs with {P₂, P₅}-factor. RAIRO: OR 56 (2022) 2895–2901. [CrossRef] [EDP Sciences] [Google Scholar]
G. Dai and Z. Hu, P₃-factors in the square of a tree. Graph. Combin. 36 (2020) 1913–1925. [CrossRef] [Google Scholar]
G. Dai, Z. Zhang, Y. Hang and X. Zhang, Some degree conditions for P_≥k-factor covered graphs. RAIRO: OR 55 (2021) 2907–2913. [CrossRef] [EDP Sciences] [Google Scholar]
W. Gao and W. Wang, Remarks on component factors. J. Oper. Res. Soc. China (2021). DOI: 10.1007/s40305-021-00357-6. [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]
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. Kanoa and A. Saito, Star-factors with large components. Discrete Math. 312 (2012) 2005–2008. [CrossRef] [MathSciNet] [Google Scholar]
M. Las Vergnas, An extension of Tutte’s 1-factor theorem. Discrete Math. 23 (1978) 241–255. [CrossRef] [MathSciNet] [Google Scholar]
W.T. Tutte, The factors of graphs. Canad. J. Math. 4 (1952) 314–328. [CrossRef] [MathSciNet] [Google Scholar]
Q. Yu, On barrier sets of star-factors. Graphs Combin. 6 (1990) 71–76. [CrossRef] [MathSciNet] [Google Scholar]
Q. Yu, Counting the number of star-factors in graphs. J. Combin. Math. Combin. Comput. 23 (1997) 65–76. [MathSciNet] [Google Scholar]
Q. Yu and C. Chen, On tree-factor covered graphs. J. Combin. Math. Combin. Comput. 2 (1987) 211–218. [MathSciNet] [Google Scholar]
Q. Yu and G. Liu, Graph Factors and Matching Extensions, Higher Education Press, Beijing (2009). [CrossRef] [Google Scholar]
H. 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, Some results about component factors in graphs. RAIRO: OR 53 (2019) 723–730. [CrossRef] [EDP Sciences] [Google Scholar]
S. Zhou, Path factors and neighborhoods of independent sets in graphs. Acta Math. Appl. Sin. Engl. Ser. DOI: 10.1007/s10255-022-1096-2. [Google Scholar]
S. Zhou, 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, 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]
S. Zhou, J. Wu and Q. Bian, On path-factor critical deleted (or covered) graphs. Aequationes Math. 96 (2022) 795–802. [CrossRef] [MathSciNet] [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.