Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. Complete-factors and f-factors;Enomoto;Discrete Math.,2000
2. Some results on the existence of 2n-factors in terms of vertex deleted subgraphs;Katerinis;Ars Combin.,1983
3. Factors and vertex-deleted subgraphs;Kimura;Discrete Math.,2006
4. The factors of graphs;Tutte;Canad. J. Math.,1952
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Discussion on Fractional (a, b, k)-critical Covered Graphs;Acta Mathematicae Applicatae Sinica, English Series;2022-04
2. Toughness for Fractional (2, b, k)-Critical Covered Graphs;Journal of the Operations Research Society of China;2021-07-23
3. Nash-Williams conditions for the existence of all fractional [a, b]-factors;Indian Journal of Pure and Applied Mathematics;2021-06-14
4. Isolated Toughness and k-Hamiltonian [a, b]-factors;Acta Mathematicae Applicatae Sinica, English Series;2020-07
5. BINDING NUMBERS AND FRACTIONAL (g, f, n)-CRITICAL GRAPHS;Journal of applied mathematics & informatics;2016-09-30