• 134 Citations
  • 6 h-Index
19882005

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

  • 134 Citations
  • 6 h-Index
  • 16 Article
Filter
Article
2005

Note on a closure concept and matching extension

Nishimura, T., 2005 Dec 1, In : Australasian Journal of Combinatorics. 32, p. 171-175 5 p.

Research output: Contribution to journalArticle

2002

A closure concept in factor-critical graphs

Nishimura, T., 2002 Dec 28, In : Discrete Mathematics. 259, 1-3, p. 319-324 6 p.

Research output: Contribution to journalArticle

Open Access
2 Citations (Scopus)
2001

On packing 3-vertex paths in a graph

Kaneko, A., Kelmans, A. & Nishimura, T., 2001 Apr, In : Journal of Graph Theory. 36, 4, p. 175-197 23 p.

Research output: Contribution to journalArticle

16 Citations (Scopus)
2000

A recursive theorem on matching extension

Chan, C. I. & Nishimura, T., 2000 Dec 1, In : Australasian Journal of Combinatorics. 21, p. 49-55 7 p.

Research output: Contribution to journalArticle

On 1-factors and matching extension

Nishimura, T., 2000 Jul 28, In : Discrete Mathematics. 222, 1-3, p. 285-290 6 p.

Research output: Contribution to journalArticle

Open Access
1 Citation (Scopus)
1999

A degree condition for the existence of 1-factors in graphs or their complements

Ando, K., Kaneko, A. & Nishimura, T., 1999 May 28, In : Discrete Mathematics. 203, 1-3, p. 1-8 8 p.

Research output: Contribution to journalArticle

Open Access
1 Citation (Scopus)
1997

A new recursive theorem on n-extendibility

Nishimura, T., 1997 Jan 1, In : Graphs and Combinatorics. 13, 1, p. 79-83 5 p.

Research output: Contribution to journalArticle

1 Citation (Scopus)

Neighborhood conditions and k-Factors

Iida, T. & Nishimura, T., 1997 Jan 1, In : Tokyo Journal of Mathematics. 20, 2, p. 411-418 8 p.

Research output: Contribution to journalArticle

12 Citations (Scopus)
1996

Component Factors and Induced Subgraphs

Nishimura, T., 1996 Aug, In : Journal of Graph Theory. 22, 4, p. 305-308 4 p.

Research output: Contribution to journalArticle

2 Citations (Scopus)

Two recursive theorems on n-extendibility

Nishimura, T. & Saito, A., 1996 Dec 25, In : Discrete Mathematics. 162, 1-3, p. 319-323 5 p.

Research output: Contribution to journalArticle

Open Access
2 Citations (Scopus)
1992

A degree condition for the existence of k‐factors

Nishimura, T., 1992 Jan 1, In : Journal of Graph Theory. 16, 2, p. 141-151 11 p.

Research output: Contribution to journalArticle

35 Citations (Scopus)
1991

An ore-type condition for the existence of k-factors in graphs

Iida, T. & Nishimura, T., 1991 Dec 1, In : Graphs and Combinatorics. 7, 4, p. 353-361 9 p.

Research output: Contribution to journalArticle

27 Citations (Scopus)
1990

Regular factors of line graphs

Nishimura, T., 1990 Nov 15, In : Discrete Mathematics. 85, 2, p. 215-219 5 p.

Research output: Contribution to journalArticle

2 Citations (Scopus)
1989

Independence number, connectivity, and r‐factors

Nishimura, T., 1989 Jan 1, In : Journal of Graph Theory. 13, 1, p. 63-69 7 p.

Research output: Contribution to journalArticle

17 Citations (Scopus)
1988

Short cycles in digraphs

Nishimura, T., 1988 Dec, In : Discrete Mathematics. 72, 1-3, p. 295-298 4 p.

Research output: Contribution to journalArticle

16 Citations (Scopus)

Short Cycles in Digraphs

Nishimura, T., 1988 Jan 1, In : Annals of Discrete Mathematics. 38, C, p. 295-298 4 p.

Research output: Contribution to journalArticle