Seiya Negami

According to our database, Seiya Negami authored at least 49 papers between 1982 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

Diagonal flips in plane graphs with triangular and quadrangular faces.

Naoki Matsumoto, Atsuhiro Nakamoto, Seiya Negami

Discret. Appl. Math., 2020

2017

Bipartite Polyhedral Maps on Closed Surfaces are Distinguishing 3-Colorable with Few Exceptions.

Seiya Negami, Thomas W. Tucker

Graphs Comb., 2017

Beans functions of graphs with small beans.

Seiya Negami

Australas. J Comb., 2017

2016

Looseness and independence number of triangulations on closed surfaces.

Atsuhiro Nakamoto, Seiya Negami, Kyoji Ohba, Yusuke Suzuki

Discuss. Math. Graph Theory, 2016

2015

3-Regular Maps on Closed Surfaces are Nearly Distinguishing 3-Colorable with Few Exceptions.

Seiya Negami

Graphs Comb., 2015

2014

Generating 3-Connected Quadrangulations on Surfaces.

Momoko Nagashima, Atsuhiro Nakamoto, Seiya Negami, Yusuke Suzuki

Ars Comb., 2014

2012

The distinguishing numbers of graphs on closed surfaces.

Seiya Negami

Discret. Math., 2012

2011

The 2-extendability of 5-connected graphs on surfaces with large representativity.

Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki

J. Comb. Theory, Ser. B, 2011

3-Connected planar graphs are 5-distinguishing colorable with two exceptions.

Gasper Fijavz, Seiya Negami, Terukazu Sano

Ars Math. Contemp., 2011

Compact Grid Representation of Graphs.

José Cáceres, Carmen Cortés, Clara Isabel Grima, Masahiro Hachimori, Alberto Márquez, Raiji Mukae, Atsuhiro Nakamoto, Seiya Negami, Rafael Robles, Jesus Valenzuela

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

The 2-Extendability of Graphs on the Projective Plane, the Torus and the Klein Bottle.

Iwao Mizukai, Seiya Negami, Yusuke Suzuki

Graphs Comb., 2010

The 2-extendability of 5-connected graphs on the Klein bottle.

Seiya Negami, Yusuke Suzuki

Discret. Math., 2010

2008

Distinguishing Numbers and Re-emebedding Structures of Triangulations on Closed Surfaces.

Seiya Negami

Electron. Notes Discret. Math., 2008

2005

Projective-planar double coverings of graphs.

Seiya Negami

Eur. J. Comb., 2005

Looseness ranges of triangulations on closed surfaces.

Seiya Negami

Discret. Math., 2005

2004

Planar triangulations which quadrangulate other surfaces.

Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota, Jozef Sirán

Eur. J. Comb., 2004

2003

Composite planar coverings of graphs.

Seiya Negami

Discret. Math., 2003

Topological Graph Theory.

Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White

Proceedings of the Handbook of Graph Theory., 2003

2002

Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces.

Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota

Electron. Notes Discret. Math., 2002

Generating triangulations on closed surfaces with minimum degree at least 4.

Atsuhiro Nakamoto, Seiya Negami

Discret. Math., 2002

Re-embedding structures of 5-connected projective-planar graphs.

Shigeru Kitakubo, Seiya Negami

Discret. Math., 2002

2001

Note on Ramsey theorems for spatial graphs.

Seiya Negami

Theor. Comput. Sci., 2001

Crossing numbers of graph embedding pairs on closed surfaces.

Seiya Negami

J. Graph Theory, 2001

Chromatic numbers of quadrangulations on closed surfaces.

Dan Archdeacon, Joan P. Hutchinson, Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota

J. Graph Theory, 2001

Triangulations on Closed Surfaces Covered by Vertices of Given Degree.

Seiya Negami, Atsuhiro Nakamoto

Graphs Comb., 2001

Diagonal flips in pseudo-triangulations on closed surfaces.

Seiya Negami

Discret. Math., 2001

2000

Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces.

Atsuhiro Nakamoto, Seiya Negami

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999

Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle.

Serge Lawrencenko, Seiya Negami

J. Comb. Theory, Ser. B, 1999

Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4.

Hideo Komuro, Atsuhiro Nakamoto, Seiya Negami

J. Comb. Theory, Ser. B, 1999

1998

Ramsey-Type Theorems for Spatial Graphs and Good Drawings.

Seiya Negami

J. Comb. Theory, Ser. B, 1998

Ramsey-Type Theorem for Spatial Graphs.

Seiya Negami

Graphs Comb., 1998

1997

Irreducible Triangulations of the Klein Bottle.

Serge Lawrencenko, Seiya Negami

J. Comb. Theory, Ser. B, 1997

1996

Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties.

Richard Brunet, Atsuhiro Nakamoto, Seiya Negami

J. Comb. Theory, Ser. B, 1996

Polynomial invariants of graphs II.

Seiya Negami, Katsuhiro Ota

Graphs Comb., 1996

1995

Polynomial Invariants of Graphs with State Models.

Seiya Negami, Kenichi Kawagoe

Discret. Appl. Math., 1995

1994

Diagonal flips in triangulations of surfaces.

Seiya Negami

Discret. Math., 1994

Three nonisomorphic triangulations of an orientable surface with the same complete graph.

Serge Lawrencenko, Seiya Negami, Arthur T. White

Discret. Math., 1994

1993

The Construction of Self-Dual Projective Polyhedra.

Dan Archdeacon, Seiya Negami

J. Comb. Theory, Ser. B, 1993

1992

Projective-planar graphs with even duals.

Seiya Negami

J. Graph Theory, 1992

1991

Projective-planar graphs with even duals II.

Seiya Negami

Proceedings of the Graph Structure Theory, 1991

1988

Re-embedding of projective-planar graphs.

Seiya Negami

J. Comb. Theory, Ser. B, 1988

The spherical genus and virtually planar graphs.

Seiya Negami

Discret. Math., 1988

1987

The virtual <i>k</i>-factorability of graphs.

Seiya Negami

J. Graph Theory, 1987

1986

Locally geodesic cycles in 2-self-centered graphs.

Seiya Negami, Guang-Han Xu

Discret. Math., 1986

Enumeration of projective-planar embeddings of graphs.

Seiya Negami

Discret. Math., 1986

1985

Unique and faithful embeddings of projective-planar graphs.

Seiya Negami

J. Graph Theory, 1985

1984

Uniquely and faithfully embeddable projective-planar triangulations.

Seiya Negami

J. Comb. Theory, Ser. B, 1984

1983

Uniqueness and faithfulness of embedding of toroidal graphs.

Seiya Negami

Discret. Math., 1983

1982

A characterization of 3-connected graphs containing a given graph.

Seiya Negami

J. Comb. Theory, Ser. B, 1982