Seiya Negami - RankMe

50 papers Journal 46Unranked 3

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