Tomoki Nakamigawa

Eur. J. Comb., 2021

Game edge-connectivity of graphs.

[BibT_eX]

[DOI]

Naoki Matsumoto

Discret. Appl. Math., 2021

2020

Convex Grabbing Game of the Point Set on the Plane.

[BibT_eX]

[DOI]

Naoki Matsumoto

Graphs Comb., 2020

Game connectivity of graphs.

[BibT_eX]

[DOI]

Naoki Matsumoto

Discret. Math., 2020

The expansion of a chord diagram and the Genocchi numbers.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2020

2017

The Expansion of a Chord Diagram and the Tutte Polynomial.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Enumeration Problems on the Expansion of a Chord Diagram.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

An extremal problem for vertex partition of complete multipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Expansions of a Chord Diagram and Alternating Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Pebble exchange on graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Partitioning a cyclic group into well-dispersed subsets with a common gap sequence.

[BibT_eX]

[DOI]

Australas. J Comb., 2015

2014

A Ramsey-type theorem for multiple disjoint copies of induced subgraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

2013

A Ramsey-type Theorem for Multiple Disjoint Copies of Induced Subgraphs (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

Node-disjoint paths in a level block of generalized hierarchical completely connected networks.

[BibT_eX]

[DOI]

Toshinori Takabatake

Theor. Comput. Sci., 2012

Counting Lattice Paths via a New Cycle Lemma.

[BibT_eX]

[DOI]

Norihide Tokushige

SIAM J. Discret. Math., 2012

Colored pebble motion on graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

2011

Counting lattice paths via a cycle lemma.

[BibT_eX]

[DOI]

Norihide Tokushige

Electron. Notes Discret. Math., 2011

2010

Vertex partition of a complete multipartite graph into two kinds of induced subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Colored Pebble Motion on Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

Connectivity of Generalized Hierarchical Completely-Connected Networks.

[BibT_eX]

[DOI]

Toshinori Takabatake

Hideo Ito

J. Interconnect. Networks, 2008

Equivalent subsets of a colored set.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Balanced decomposition of a vertex-colored graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Vertex disjoint equivalent subgraphs of order 3.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

2005

One-dimensional Tilings Using Tiles with Two Gap Lengths.

[BibT_eX]

[DOI]

Graphs Comb., 2005

2004

Separating pairs of points in the plane by monotone subsequences.

[BibT_eX]

[DOI]

Mamoru Watanabe

Australas. J Comb., 2004

2003

A partition problem on colored sets.

[BibT_eX]

[DOI]

Discret. Math., 2003

A Note on the Decomposition Dimension of Complete Graphs.

[BibT_eX]

Ars Comb., 2003

2002

On the decomposition dimension of trees.

[BibT_eX]

[DOI]

Hikoe Enomoto

Discret. Math., 2002

2001

Nakade -- a graph theoretic concept in Go.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

A generalization of diagonal flips in a convex polygon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Induced Graph Theorem on Magic Valuations.

[BibT_eX]

Hikoe Enomoto

Kayo Masuda

Ars Comb., 2000

1998

One-Dimensional Tilings with Congruent Copies of a 3-Point Set.

[BibT_eX]

[DOI]

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

1997

On the Pagenumber of Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Hikoe Enomoto