Seiya Negami

Publication Activity (10 Years)

Years Active: 1982-2020
Publications (10 Years): 4

Top Topics

Surface Matching

Queueing Networks

Top Venues

Discret. Appl. Math.

Discuss. Math. Graph Theory

Publications

Naoki Matsumoto, Atsuhiro Nakamoto, Seiya Negami
Diagonal flips in plane graphs with triangular and quadrangular faces. Discret. Appl. Math. 283 (2020)
Seiya Negami
Beans functions of graphs with small beans. Australas. J Comb. 67 (2017)
Seiya Negami, Thomas W. Tucker
Bipartite Polyhedral Maps on Closed Surfaces are Distinguishing 3-Colorable with Few Exceptions. Graphs Comb. 33 (6) (2017)
Atsuhiro Nakamoto, Seiya Negami, Kyoji Ohba, Yusuke Suzuki
Looseness and independence number of triangulations on closed surfaces. Discuss. Math. Graph Theory 36 (3) (2016)
Seiya Negami
3-Regular Maps on Closed Surfaces are Nearly Distinguishing 3-Colorable with Few Exceptions. Graphs Comb. 31 (6) (2015)
Momoko Nagashima, Atsuhiro Nakamoto, Seiya Negami, Yusuke Suzuki
Generating 3-Connected Quadrangulations on Surfaces. Ars Comb. 116 (2014)
Seiya Negami
The distinguishing numbers of graphs on closed surfaces. Discret. Math. 312 (5) (2012)
Gasper Fijavz, Seiya Negami, Terukazu Sano
3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars Math. Contemp. 4 (1) (2011)
José Cáceres, Carmen Cortés, Clara Isabel Grima, Masahiro Hachimori, Alberto Márquez, Raiji Mukae, Atsuhiro Nakamoto, Seiya Negami, Rafael Robles, Jesus Valenzuela
Compact Grid Representation of Graphs. EGC (2011)
Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki
The 2-extendability of 5-connected graphs on surfaces with large representativity. J. Comb. Theory, Ser. B 101 (4) (2011)
Iwao Mizukai, Seiya Negami, Yusuke Suzuki
The 2-Extendability of Graphs on the Projective Plane, the Torus and the Klein Bottle. Graphs Comb. 26 (4) (2010)
Seiya Negami, Yusuke Suzuki
The 2-extendability of 5-connected graphs on the Klein bottle. Discret. Math. 310 (19) (2010)
Seiya Negami
Distinguishing Numbers and Re-emebedding Structures of Triangulations on Closed Surfaces. Electron. Notes Discret. Math. 31 (2008)
Seiya Negami
Looseness ranges of triangulations on closed surfaces. Discret. Math. 303 (1-3) (2005)
Seiya Negami
Projective-planar double coverings of graphs. Eur. J. Comb. 26 (3-4) (2005)
Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota
Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. Discret. Math. 285 (1-3) (2004)
Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota, Jozef Sirán
Planar triangulations which quadrangulate other surfaces. Eur. J. Comb. 25 (6) (2004)
Seiya Negami
Composite planar coverings of graphs. Discret. Math. 268 (1-3) (2003)
Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota
Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces. Electron. Notes Discret. Math. 11 (2002)
Atsuhiro Nakamoto, Seiya Negami
Generating triangulations on closed surfaces with minimum degree at least 4. Discret. Math. 244 (1-3) (2002)
Shigeru Kitakubo, Seiya Negami
Re-embedding structures of 5-connected projective-planar graphs. Discret. Math. 244 (1-3) (2002)
Seiya Negami
Diagonal flips in pseudo-triangulations on closed surfaces. Discret. Math. 240 (1-3) (2001)
Seiya Negami, Atsuhiro Nakamoto
Triangulations on Closed Surfaces Covered by Vertices of Given Degree. Graphs Comb. 17 (3) (2001)
Dan Archdeacon, Joan P. Hutchinson, Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota
Chromatic numbers of quadrangulations on closed surfaces. J. Graph Theory 37 (2) (2001)
Seiya Negami
Crossing numbers of graph embedding pairs on closed surfaces. J. Graph Theory 36 (1) (2001)
Seiya Negami
Note on Ramsey theorems for spatial graphs. Theor. Comput. Sci. 263 (1-2) (2001)
Atsuhiro Nakamoto, Seiya Negami
Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces. JCDCG (2000)
Hideo Komuro, Atsuhiro Nakamoto, Seiya Negami
Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4. J. Comb. Theory, Ser. B 76 (1) (1999)
Serge Lawrencenko, Seiya Negami
Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle. J. Comb. Theory, Ser. B 77 (1) (1999)
Seiya Negami
Ramsey-Type Theorems for Spatial Graphs and Good Drawings. J. Comb. Theory, Ser. B 72 (1) (1998)
Seiya Negami
Ramsey-Type Theorem for Spatial Graphs. Graphs Comb. 14 (1) (1998)
Serge Lawrencenko, Seiya Negami
Irreducible Triangulations of the Klein Bottle. J. Comb. Theory, Ser. B 70 (2) (1997)
Richard Brunet, Atsuhiro Nakamoto, Seiya Negami
Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties. J. Comb. Theory, Ser. B 68 (2) (1996)
Seiya Negami, Katsuhiro Ota
Polynomial invariants of graphs II. Graphs Comb. 12 (1) (1996)
Seiya Negami, Kenichi Kawagoe
Polynomial Invariants of Graphs with State Models. Discret. Appl. Math. 56 (2-3) (1995)
Seiya Negami
Diagonal flips in triangulations of surfaces. Discret. Math. 135 (1-3) (1994)
Serge Lawrencenko, Seiya Negami, Arthur T. White
Three nonisomorphic triangulations of an orientable surface with the same complete graph. Discret. Math. 135 (1-3) (1994)
Dan Archdeacon, Seiya Negami
The Construction of Self-Dual Projective Polyhedra. J. Comb. Theory, Ser. B 59 (1) (1993)
Seiya Negami
Projective-planar graphs with even duals. J. Graph Theory 16 (4) (1992)
Seiya Negami
Projective-planar graphs with even duals II. Graph Structure Theory (1991)
Seiya Negami
Re-embedding of projective-planar graphs. J. Comb. Theory, Ser. B 44 (3) (1988)
Seiya Negami
The spherical genus and virtually planar graphs. Discret. Math. 70 (2) (1988)
Seiya Negami
-factorability of graphs. J. Graph Theory 11 (3) (1987)
Seiya Negami
Enumeration of projective-planar embeddings of graphs. Discret. Math. 62 (3) (1986)
Seiya Negami, Guang-Han Xu
Locally geodesic cycles in 2-self-centered graphs. Discret. Math. 58 (3) (1986)
Seiya Negami
Unique and faithful embeddings of projective-planar graphs. J. Graph Theory 9 (2) (1985)
Seiya Negami
Uniquely and faithfully embeddable projective-planar triangulations. J. Comb. Theory, Ser. B 36 (2) (1984)
Seiya Negami
Uniqueness and faithfulness of embedding of toroidal graphs. Discret. Math. 44 (2) (1983)
Seiya Negami
A characterization of 3-connected graphs containing a given graph. J. Comb. Theory, Ser. B 32 (1) (1982)