![]() | ![]() |
2006 | ||
---|---|---|
4 | EE | Taro Tokuda: Connected factors in K1, n-free graphs containing an [a, b]-factor. Discrete Mathematics 306(21): 2806-2810 (2006) |
2003 | ||
3 | EE | Taro Tokuda, Baoguang Xu, Jianfang Wang: Connected Factors and Spanning Trees in Graphs. Graphs and Combinatorics 19(2): 259-262 (2003) |
2000 | ||
2 | EE | Hikoe Enomoto, Taro Tokuda: Complete-factors and f-factors. Discrete Mathematics 220(1-3): 239-242 (2000) |
1999 | ||
1 | EE | Taro Tokuda: Connected [a, b]-factors in K1, n-free graphs containing an [a, b]-factor. Discrete Mathematics 207(1-3): 293-298 (1999) |
1 | Hikoe Enomoto | [2] |
2 | Jianfang Wang | [3] |
3 | Baoguang Xu | [3] |