Tsuyoshi Nishimura

According to our database, Tsuyoshi Nishimura authored at least 15 papers between 1988 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

Study on the Acoustic Characteristics of Sound Proofing Ventilation Unit.

Hayato Goto, Tsunetoshi Nasu, Noriko Horibe, Tsuyoshi Nishimura

Proceedings of the IIAI 3rd International Conference on Advanced Applied Informatics, 2014

2005

Note on a closure concept and matching extension.

Tsuyoshi Nishimura

Australas. J Comb., 2005

2002

A closure concept in factor-critical graphs.

Tsuyoshi Nishimura

Discret. Math., 2002

2001

On packing 3-vertex paths in a graph.

Atsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura

J. Graph Theory, 2001

2000

On 1-factors and matching extension.

Tsuyoshi Nishimura

Discret. Math., 2000

A recursive theorem on matching extension.

Chi-i Chan, Tsuyoshi Nishimura

Australas. J Comb., 2000

1999

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

Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura

Discret. Math., 1999

1997

A new recursive theorem on<i>n</i>-extendibility.

Tsuyoshi Nishimura

Graphs Comb., 1997

1996

Component factors and induced subgraphs.

Tsuyoshi Nishimura

J. Graph Theory, 1996

Two recursive theorems on n-extendibility.

Tsuyoshi Nishimura, Akira Saito

Discret. Math., 1996

1992

A degree condition for the existence of <i>k</i>-factors.

Tsuyoshi Nishimura

J. Graph Theory, 1992

1991

An ore-type condition for the existence of<i>k</i>-factors in graphs.

Tadashi Iida, Tsuyoshi Nishimura

Graphs Comb., 1991

1990

Regular factors of line graphs.

Tsuyoshi Nishimura

Discret. Math., 1990

1989

Independence number, connectivity, and r-factors.

Tsuyoshi Nishimura

J. Graph Theory, 1989

1988

Short cycles in digraphs.

Tsuyoshi Nishimura

Discret. Math., 1988