Diagonal flips in plane graphs with triangular and quadrangular faces. - Matsumoto, Naoki; Nakamoto, Atsuhiro; Negami, Seiya (Discret. Appl. Math., 2020)

Beans functions of graphs with small beans. - Negami, Seiya (Australas. J Comb., 2017)

Bipartite Polyhedral Maps on Closed Surfaces are Distinguishing 3-Colorable with Few Exceptions. - Negami, Seiya; Tucker, Thomas W. (Graphs Comb., 2017)

Looseness and independence number of triangulations on closed surfaces. - Nakamoto, Atsuhiro; Negami, Seiya; Ohba, Kyoji; Suzuki, Yusuke (Discuss. Math. Graph Theory, 2016)

3-Regular Maps on Closed Surfaces are Nearly Distinguishing 3-Colorable with Few Exceptions. - Negami, Seiya (Graphs Comb., 2015)

Generating 3-Connected Quadrangulations on Surfaces. - Nagashima, Momoko; Nakamoto, Atsuhiro; Negami, Seiya; Suzuki, Yusuke (Ars Comb., 2014)

The distinguishing numbers of graphs on closed surfaces. - Negami, Seiya (Discret. Math., 2012)

3-Connected planar graphs are 5-distinguishing colorable with two exceptions. - Fijavz, Gasper; Negami, Seiya; Sano, Terukazu (Ars Math. Contemp., 2011)

The 2-extendability of 5-connected graphs on surfaces with large representativity. - Kawarabayashi, Ken-ichi; Negami, Seiya; Plummer, Michael D.; Suzuki, Yusuke (J. Comb. Theory B, 2011)

Compact Grid Representation of Graphs. - Cáceres, José; Cortés, Carmen; Grima, Clara Isabel; Hachimori, Masahiro; Márquez, Alberto; Mukae, Raiji; Nakamoto, Atsuhiro; Negami, Seiya; Robles, Rafael; Valenzuela, Jesus (2011)

The 2-extendability of 5-connected graphs on the Klein bottle. - Negami, Seiya; Suzuki, Yusuke (Discret. Math., 2010)

The 2-Extendability of Graphs on the Projective Plane, the Torus and the Klein Bottle. - Mizukai, Iwao; Negami, Seiya; Suzuki, Yusuke (Graphs Comb., 2010)

Distinguishing Numbers and Re-emebedding Structures of Triangulations on Closed Surfaces. - Negami, Seiya (Electron. Notes Discret. Math., 2008)

Looseness ranges of triangulations on closed surfaces. - Negami, Seiya (Discret. Math., 2005)

Projective-planar double coverings of graphs. - Negami, Seiya (Eur. J. Comb., 2005)

Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. - Nakamoto, Atsuhiro; Negami, Seiya; Ota, Katsuhiro (Discret. Math., 2004)

Planar triangulations which quadrangulate other surfaces. - Nakamoto, Atsuhiro; Negami, Seiya; Ota, Katsuhiro; Sirán, Jozef (Eur. J. Comb., 2004)

Composite planar coverings of graphs. - Negami, Seiya (Discret. Math., 2003)

Topological Graph Theory. - Pisanski, Tomaz; Potocnik, Primoz; Chen, Jianer; Gross, Jonathan L.; Tucker, Thomas W.; Vince, Andrew; Archdeacon, Dan; Negami, Seiya; White, Arthur T. (2003)

Re-embedding structures of 5-connected projective-planar graphs. - Kitakubo, Shigeru; Negami, Seiya (Discret. Math., 2002)

Generating triangulations on closed surfaces with minimum degree at least 4. - Nakamoto, Atsuhiro; Negami, Seiya (Discret. Math., 2002)

Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces. - Nakamoto, Atsuhiro; Negami, Seiya; Ota, Katsuhiro (Electron. Notes Discret. Math., 2002)

Diagonal flips in pseudo-triangulations on closed surfaces. - Negami, Seiya (Discret. Math., 2001)

Triangulations on Closed Surfaces Covered by Vertices of Given Degree. - Negami, Seiya; Nakamoto, Atsuhiro (Graphs Comb., 2001)

Crossing numbers of graph embedding pairs on closed surfaces. - Negami, Seiya (J. Graph Theory, 2001)

Chromatic numbers of quadrangulations on closed surfaces. - Archdeacon, Dan; Hutchinson, Joan P.; Nakamoto, Atsuhiro; Negami, Seiya; Ota, Katsuhiro (J. Graph Theory, 2001)

Note on Ramsey theorems for spatial graphs. - Negami, Seiya (Theor. Comput. Sci., 2001)

Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces. - Nakamoto, Atsuhiro; Negami, Seiya (2000)

Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4. - Komuro, Hideo; Nakamoto, Atsuhiro; Negami, Seiya (J. Comb. Theory B, 1999)

Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle. - Lawrencenko, Serge; Negami, Seiya (J. Comb. Theory B, 1999)

Ramsey-Type Theorem for Spatial Graphs. - Negami, Seiya (Graphs Comb., 1998)

Ramsey-Type Theorems for Spatial Graphs and Good Drawings. - Negami, Seiya (J. Comb. Theory B, 1998)

Irreducible Triangulations of the Klein Bottle. - Lawrencenko, Serge; Negami, Seiya (J. Comb. Theory B, 1997)

Polynomial invariants of graphs II. - Negami, Seiya; Ota, Katsuhiro (Graphs Comb., 1996)

Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties. - Brunet, Richard; Nakamoto, Atsuhiro; Negami, Seiya (J. Comb. Theory, Ser. B, 1996)

Polynomial Invariants of Graphs with State Models. - Negami, Seiya; Kawagoe, Kenichi (Discret. Appl. Math., 1995)

Diagonal flips in triangulations of surfaces. - Negami, Seiya (Discret. Math., 1994)

Three nonisomorphic triangulations of an orientable surface with the same complete graph. - Lawrencenko, Serge; Negami, Seiya; White, Arthur T. (Discret. Math., 1994)

The Construction of Self-Dual Projective Polyhedra. - Archdeacon, Dan; Negami, Seiya (J. Comb. Theory B, 1993)

Projective-planar graphs with even duals. - Negami, Seiya (J. Graph Theory, 1992)

Projective-planar graphs with even duals II. - Negami, Seiya (1991)

The spherical genus and virtually planar graphs. - Negami, Seiya (Discret. Math., 1988)

Re-embedding of projective-planar graphs. - Negami, Seiya (J. Comb. Theory B, 1988)

The virtual k-factorability of graphs. - Negami, Seiya (J. Graph Theory, 1987)

Locally geodesic cycles in 2-self-centered graphs. - Negami, Seiya; Xu, Guang-Han (Discret. Math., 1986)

Enumeration of projective-planar embeddings of graphs. - Negami, Seiya (Discret. Math., 1986)

Unique and faithful embeddings of projective-planar graphs. - Negami, Seiya (J. Graph Theory, 1985)

Uniquely and faithfully embeddable projective-planar triangulations. - Negami, Seiya (J. Comb. Theory B, 1984)

Uniqueness and faithfulness of embedding of toroidal graphs. - Negami, Seiya (Discret. Math., 1983)

A characterization of 3-connected graphs containing a given graph. - Negami, Seiya (J. Comb. Theory B, 1982)