Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Nishimura, Tsuyoshi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On packing 3-vertex paths in a graph
Atsushi Kaneko
,
Alexander Kelmans
,
Tsuyoshi Nishimura
Journal of Graph Theory
36
(4), 2001, pp. 175-197
A new recursive theorem on
n
-extendibility
Tsuyoshi Nishimura
Graphs and Combinatorics
13
, 1997, pp. 79-83
Component factors and induced subgraphs
Tsuyoshi Nishimura
Journal of Graph Theory
22
(4), 1996, pp. 305-308
A degree condition for the existence of
k
-factors
Tsuyoshi Nishimura
Journal of Graph Theory
16
(2), 1992, pp. 141-151
An ore-type condition for the existence of
k
-factors in graphs
Tadashi Iida
,
Tsuyoshi Nishimura
Graphs and Combinatorics
7
, 1991, pp. 353-361
Independence number, connectivity, and
r
-factors
Tsuyoshi Nishimura
Journal of Graph Theory
13
(1), 1989, pp. 63-69