Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Amahashi, A., Kano, M. Factors with given components. Ann. Discrete Mathematics, 42: 1–6 (1982)
2. Axenovich, M., Rollin, J. Brooks type results for conflict-free colorings and {a, b}-factors in graphs. Discrete Mathematics, 338: 2295–2301 (2015)
3. Berge, C., Las Vergnas, M. On the existence of subgraphs with degree constraints. Proc. K. Ned. Acad. Wet. Amsterdam (A), 81: 165–176 (1978)
4. Chiba, S., Yamashita, T. A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs. Discrete Mathematics, 340: 2871–2877 (2017)
5. Gao, W., Guirao, J., Chen, Y. A toughness condition for fractional (k, m)-deleted graphs revisited. Acta Mathematica Sinica-English Series, 35: 1227–1237 (2019)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Isolated toughness for fractional (2;b;k)-critical covered graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-11-15
2. On path-factor critical uniform graphs;Indian Journal of Pure and Applied Mathematics;2023-06-04
3. Path Factors and Neighborhoods of Independent Sets in Graphs;Acta Mathematicae Applicatae Sinica, English Series;2023-04
4. Two sufficient conditions for odd [1,b]-factors in graphs;Linear Algebra and its Applications;2023-03
5. Some sufficient conditions for path-factor uniform graphs;Aequationes mathematicae;2023-02-28