A degree condition for the existence of regular factors in K1, n-free graphs. - Katsuhiro Ota; Taro Tokuda (J. Graph Theory, 1996)

Connected Factors in K1, n-free Graphs Containing a (g, f)-factor. - Baoguang Xu; Zhenhong Liu; Taro Tokuda (Graphs Comb., 1998)

Connected [a, b]-factors in K1, n-free graphs containing an [a, b]-factor. - Taro Tokuda (Discret. Math., 1999)

Complete-factors and f-factors. - Hikoe Enomoto; Taro Tokuda (Discret. Math., 2000)

Decomposition of Graphs into (g, f)-Factors. - Guiying Yan; Jiaofeng Pan; C. K. Wong; Taro Tokuda (Graphs Comb., 2000)

Connected Factors and Spanning Trees in Graphs. - Taro Tokuda; Baoguang Xu; Jianfang Wang (Graphs Comb., 2003)

Connected factors in K1, n-free graphs containing an [a, b]-factor. - Taro Tokuda (Discret. Math., 2006)

Departure Processes from GI/GI/∞ and GI/GI/c/c with Bursty Arrivals. - Fumiaki Machihara; Taro Tokuda (IEICE Trans. Commun., 2017)