Tsuyoshi Nishimura

Scopus著者プロファイル

h-index

年別の研究成果

Pureに変更を加えた場合、すぐここに表示されます。

16 Article

16 件

2005
Note on a closure concept and matching extension
Nishimura, T., 2005 12月 1, In: Australasian Journal of Combinatorics. 32, p. 171-175 5 p.
研究成果: Article › 査読
2002
A closure concept in factor-critical graphs
Nishimura, T., 2002 12月 28, In: Discrete Mathematics. 259, 1-3, p. 319-324 6 p.
研究成果: Article › 査読

Open Access
3 被引用数 (Scopus)
2001
On packing 3-vertex paths in a graph
Kaneko, A., Kelmans, A. & Nishimura, T., 2001 4月, In: Journal of Graph Theory. 36, 4, p. 175-197 23 p.
研究成果: Article › 査読
29 被引用数 (Scopus)
2000
A recursive theorem on matching extension
Chan, C. I. & Nishimura, T., 2000, In: Australasian Journal of Combinatorics. 21, p. 49-55 7 p.
研究成果: Article › 査読
On 1-factors and matching extension
Nishimura, T., 2000 7月 28, In: Discrete Mathematics. 222, 1-3, p. 285-290 6 p.
研究成果: Article › 査読

Open Access
1 被引用数 (Scopus)
1999
A degree condition for the existence of 1-factors in graphs or their complements
Ando, K., Kaneko, A. & Nishimura, T., 1999 5月 28, In: Discrete Mathematics. 203, 1-3, p. 1-8 8 p.
研究成果: Article › 査読

Open Access
2 被引用数 (Scopus)
1997
A new recursive theorem on n-extendibility
Nishimura, T., 1997 1月 1, In: Graphs and Combinatorics. 13, 1, p. 79-83 5 p.
研究成果: Article › 査読
1 被引用数 (Scopus)
Neighborhood conditions and k-Factors
Iida, T. & Nishimura, T., 1997, In: Tokyo Journal of Mathematics. 20, 2, p. 411-418 8 p.
研究成果: Article › 査読
15 被引用数 (Scopus)
1996
Component Factors and Induced Subgraphs
Nishimura, T., 1996 8月, In: Journal of Graph Theory. 22, 4, p. 305-308 4 p.
研究成果: Article › 査読
2 被引用数 (Scopus)
Two recursive theorems on n-extendibility
Nishimura, T. & Saito, A., 1996 12月 25, In: Discrete Mathematics. 162, 1-3, p. 319-323 5 p.
研究成果: Article › 査読

Open Access
2 被引用数 (Scopus)
1992
A degree condition for the existence of k‐factors
Nishimura, T., 1992 6月, In: Journal of Graph Theory. 16, 2, p. 141-151 11 p.
研究成果: Article › 査読
39 被引用数 (Scopus)
1991
An ore-type condition for the existence of k-factors in graphs
Iida, T. & Nishimura, T., 1991 12月 1, In: Graphs and Combinatorics. 7, 4, p. 353-361 9 p.
研究成果: Article › 査読
29 被引用数 (Scopus)
1990
Regular factors of line graphs
Nishimura, T., 1990 11月 15, In: Discrete Mathematics. 85, 2, p. 215-219 5 p.
研究成果: Article › 査読
2 被引用数 (Scopus)
1989
Independence number, connectivity, and r‐factors
Nishimura, T., 1989 3月, In: Journal of Graph Theory. 13, 1, p. 63-69 7 p.
研究成果: Article › 査読
23 被引用数 (Scopus)
1988
Short cycles in digraphs
Nishimura, T., 1988 12月, In: Discrete Mathematics. 72, 1-3, p. 295-298 4 p.
研究成果: Article › 査読
17 被引用数 (Scopus)
Short Cycles in Digraphs
Nishimura, T., 1988 1月 1, In: Annals of Discrete Mathematics. 38, C, p. 295-298 4 p.
研究成果: Article › 査読
1 被引用数 (Scopus)

西村 強

研究成果

検索結果

西村強