Author:
Liu Guizhen,Yu Qinglin,Zhang Lanju
Reference7 articles.
1. Two theorems in graph theory;Berge;Proc. Nat. Acad. Sci. USA,1957
2. A degree condition for the existence of connected [k,k+1]-factors;Cai;Syst. Sci. Math. Sci.,1995
3. Connected [k,k+1]-factors of graphs;Cai;Discrete Math.,1997
4. Maximum (g,f)-factors of a general graph;Chen;Discrete Math.,1991
5. Tough graphs and hamiltonian circuits;Chvátal;Discrete Math.,1973
Cited by
11 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. An improvement of the previous result on fractional (a,b,k)-critical covered graphs;Indian Journal of Pure and Applied Mathematics;2022-11-10
3. Remarks on restricted fractional (g,f)-factors in graphs;Discrete Applied Mathematics;2022-08
4. Degree conditions for fractional (a,b,k)-critical covered graphs;Information Processing Letters;2019-12
5. Remarks on Fractional ID-k-factor-critical Graphs;Acta Mathematicae Applicatae Sinica, English Series;2019-04