The SCEAS System
| |||||||

## Search the dblp DataBase
Seiya Negami:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Seiya Negami
**Projective-planar graphs with even duals II.**[Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:363-380 [Conf] - Atsuhiro Nakamoto, Seiya Negami
**Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces.**[Citation Graph (0, 0)][DBLP] JCDCG, 2000, pp:274-279 [Conf] - Seiya Negami, Kenichi Kawagoe
**Polynomial Invariants of Graphs with State Models.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:323-331 [Journal] - Shigeru Kitakubo, Seiya Negami
**Re-embedding structures of 5-connected projective-planar graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:244, n:1-3, pp:211-221 [Journal] - Atsuhiro Nakamoto, Seiya Negami
**Generating triangulations on closed surfaces with minimum degree at least 4.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:244, n:1-3, pp:345-349 [Journal] - Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota
**Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:285, n:1-3, pp:211-218 [Journal] - Seiya Negami
**Diagonal flips in pseudo-triangulations on closed surfaces.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:240, n:1-3, pp:187-196 [Journal] - Seiya Negami
**Composite planar coverings of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:268, n:1-3, pp:207-216 [Journal] - Seiya Negami
**Looseness ranges of triangulations on closed surfaces.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:303, n:1-3, pp:167-174 [Journal] - Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota, Jozef Sirán
**Planar triangulations which quadrangulate other surfaces.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2004, v:25, n:6, pp:817-833 [Journal] - Seiya Negami
**Projective-planar double coverings of graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:3-4, pp:325-338 [Journal] - Seiya Negami, Atsuhiro Nakamoto
**Triangulations on Closed Surfaces Covered by Vertices of Given Degree.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2001, v:17, n:3, pp:529-537 [Journal] - Dan Archdeacon, Seiya Negami
**The Construction of Self-Dual Projective Polyhedra.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:122-131 [Journal] - Richard Brunet, Atsuhiro Nakamoto, Seiya Negami
**Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:295-309 [Journal] - Hideo Komuro, Atsuhiro Nakamoto, Seiya Negami
**Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:76, n:1, pp:68-92 [Journal] - Serge Lawrencenko, Seiya Negami
**Irreducible Triangulations of the Klein Bottle.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:265-291 [Journal] - Serge Lawrencenko, Seiya Negami
**Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:211-218 [Journal] - Seiya Negami
**A characterization of 3-connected graphs containing a given graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:32, n:1, pp:69-74 [Journal] - Seiya Negami
**Uniquely and faithfully embeddable projective-planar triangulations.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1984, v:36, n:2, pp:189-193 [Journal] - Seiya Negami
**Re-embedding of projective-planar graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:276-299 [Journal] - Seiya Negami
**Ramsey-Type Theorems for Spatial Graphs and Good Drawings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:53-62 [Journal] - Seiya Negami
**Note on Ramsey theorems for spatial graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:263, n:1-2, pp:205-210 [Journal] - Seiya Negami
**Uniqueness and faithfulness of embedding of toroidal graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:44, n:2, pp:161-180 [Journal] - Seiya Negami, Guang-Han Xu
**Locally geodesic cycles in 2-self-centered graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:58, n:3, pp:263-268 [Journal] - Seiya Negami
**Enumeration of projective-planar embeddings of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:62, n:3, pp:299-306 [Journal] - Seiya Negami
**The spherical genus and virtually planar graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:70, n:2, pp:159-168 [Journal] - Serge Lawrencenko, Seiya Negami, Arthur T. White
**Three nonisomorphic triangulations of an orientable surface with the same complete graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:135, n:1-3, pp:367-369 [Journal] - Seiya Negami
**Diagonal flips in triangulations of surfaces.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:135, n:1-3, pp:225-232 [Journal] **The 2-extendability of 5-connected graphs on the Klein bottle.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |