Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference33 articles.
1. Zhou, S., Xu, Y., and Sun, Z., Degree Conditions for Fractional (a,b,k)-Critical Covered Graphs, Inform. Process. Lett., 2019, vol. 152, Article 105838 (5 pp.).
2. Yuan, Y. and Hao, R.-X., Neighborhood Union Conditions for Fractional [a, b]-Covered Graphs, Bull. Malays. Math. Sci. Soc., 2020, vol. 43, no. 1, pp. 157–167.
3. Liu, G. and Zhang, L., Characterizations of Maximum Fractional (g, f)-Factors of Graphs, Discrete Appl. Math., 2008, vol. 156, no. 12, pp. 2293–2299.
4. Belck, H.-B., Reguläre Faktoren von Graphen, J. Reine Angew. Math., 1950, vol. 188, pp. 228–252.
5. Enomoto, H., Jackson, B., Katerinis, P., and Satio, A., Toughness and the Existence of k-Factors, J. Graph Theory, 1957, vol. 9, no. 1, pp. 87–95.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献