The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Seiya Negami: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Seiya Negami
    Projective-planar graphs with even duals II. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:363-380 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. Seiya Negami
    Composite planar coverings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:207-216 [Journal]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]

  29. The 2-extendability of 5-connected graphs on the Klein bottle. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002