SCEAS

The SCEAS System

Title:
Author:

Tsuyoshi Nishimura: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Tsuyoshi Nishimura
On 1-factors and matching extension. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2000, v:222, n:1-3, pp:285-290 [Journal]
Tsuyoshi Nishimura
A closure concept in factor-critical graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:259, n:1-3, pp:319-324 [Journal]
Tsuyoshi Nishimura
Short cycles in digraphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:72, n:1-3, pp:295-298 [Journal]
Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura
A degree condition for the existence of 1-factors in graphs or their complements. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:203, n:1-3, pp:1-8 [Journal]
Tsuyoshi Nishimura, Akira Saito
Two recursive theorems on n-extendibility. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:162, n:1-3, pp:319-323 [Journal]
Tsuyoshi Nishimura
Regular factors of line graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:85, n:2, pp:215-219 [Journal]

Search in 0.001secs, Finished in 0.001secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP