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
Hilfe
Suche: Author="Negami, Seiya"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The 2-extendability of 5-connected graphs on surfaces with large representativity
Ken-ichi Kawarabayashi
,
Seiya Negami
,
Michael D. Plummer
,
Yusuke Suzuki
Journal of Combinatorial Theory Series B
101
(4), 2011, pp. 206-213
The 2-extendability of graphs on the projective plane, the torus and the Klein bottle
Iwao Mizukai
,
Seiya Negami
,
Yusuke Suzuki
Graphs and Combinatorics
26
(4), 2010, pp. 549-557
Triangulations on closed surfaces covered by vertices of given degree
Seiya Negami
,
Atsuhiro Nakamoto
Graphs and Combinatorics
17
(3), 2001, pp. 529-537
Topological graph theory from Japan
Seiya Negami
Interdisciplinary Information Sciences
7
(1), 2001, pp. 99-112
Crossing numbers of graph embedding pairs on closed surfaces
Seiya Negami
Journal of Graph Theory
36
(1), 2001, pp. 8-23
Note on Ramsey theorems for spatial graphs
Seiya Negami
Theoretical Computer Science
263
(1-2), 2001, pp. 205-210
Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
Hideo Komuro
,
Atsuhiro Nakamoto
,
Seiya Negami
Journal of Combinatorial Theory Series B
76
(1), 1999, pp. 68-92
Constructing the graphs that triangulate both the torus and the Klein bottle
Serge Lawrencenko
,
Seiya Negami
Journal of Combinatorial Theory Series B
77
(1), 1999, pp. 211-218
Ramsey-type theorem for spatial graphs
Seiya Negami
Graphs and Combinatorics
14
(1), 1998, pp. 75-80
Ramsey-type theorems for spatial graphs and good drawings
Seiya Negami
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 53-62
Irreducible triangulations of the Klein bottle
Serge Lawrencenko
,
Seiya Negami
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 265-291
Diagonal flips of triangulations on closed surfaces preserving specified properties
Richard Brunet
,
Atsuhiro Nakamoto
,
Seiya Negami
Journal of Combinatorial Theory Series B
68
(2), 1996, pp. 295-309
Polynomial invariants of graphs II
Seiya Negami
,
Katsuhiro Ota
Graphs and Combinatorics
12
, 1996, pp. 189-198
Polynomial invariants of graphs with state models
Seiya Negami
,
Kenichi Kawagoe
Discrete Applied Mathematics
56
, 1995, pp. 323-331
The construction of self-dual projective polyhedra
Dan Archdeacon
,
Seiya Negami
Journal of Combinatorial Theory Series B
59
(1), 1993, pp. 122-131
Projective-planar graphs with even duals
Seiya Negami
Journal of Graph Theory
16
(4), 1992, pp. 287-295
Re-embedding of projective-planar graphs
Seiya Negami
Journal of Combinatorial Theory Series B
44
(3), 1988, June, pp. 276-299
The virtual
k
-factorability of graphs
Seiya Negami
Journal of Graph Theory
11
(3), 1987, pp. 359-365
Unique and faithful embeddings of projective-planar graphs
Seiya Negami
Journal of Graph Theory
9
(2), 1985, pp. 235-243
Uniquely and faithfully embeddable projective-planar triangulations
Seiya Negami
Journal of Combinatorial Theory Series B
36
, 1984, pp. 189-193
A characterization of 3-connected graphs containing a given graph
Seiya Negami
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 69-74