On the Toughness and Fractional Perfect Matching of Graphs
On the Toughness and Fractional Perfect Matching of Graphs
-
1邱成功,任晓慧,马英红.图的分数[a,b]-因子存在的一个条件[J].计算机工程与应用,2006,42(26):41-42.
-
2Lutz VOLKMANN,Axel ZINGSEM.Smallest Close to Regular Bipartite Graphs without an Almost Perfect Matching[J].Acta Mathematica Sinica,English Series,2010,26(8):1403-1412. 被引量：2
-
3邱成功,任晓慧,马英红.关于图的分数k-因子存在性的一些结果[J].计算机工程与应用,2005,41(36):33-35.
-
4WU ZeFang,LIU GuiZhe,YU QingLin.Toughness and [a,b]-factors with inclusion/exclusion properties[J].Science China Mathematics,2011,54(7):1491-1498.
-
5Toughness的终极体验 G—SHOCK“SHOCK THE WORLD”上海站全纪录[J].新潮电子,2011(8):24-25.
-
6彭波,高炜.特殊框架下分数(g,f,m)-消去图的不相邻顶点度条件[J].山西大学学报（自然科学版）,2017,40(2):262-266. 被引量：1
-
7卡西欧G—SHOCK“SHOCK THE WORLD”上海站开幕·黄立行跨界登场[J].财富时代（上品）,2011(9):109-109.
