| |
| 2008 | ||
|---|---|---|
| 13 | EE | Shinya Fujita, Tomoki Nakamigawa: Balanced decomposition of a vertex-colored graph. Discrete Applied Mathematics 156(18): 3339-3344 (2008) |
| 12 | EE | Tomoki Nakamigawa: Equivalent subsets of a colored set. Eur. J. Comb. 29(7): 1782-1799 (2008) |
| 11 | EE | Toshinori Takabatake, Tomoki Nakamigawa, Hideo Ito: Connectivity of Generalized Hierarchical Completely-Connected Networks. Journal of Interconnection Networks 9(1/2): 127-139 (2008) |
| 2007 | ||
| 10 | EE | Tomoki Nakamigawa: Vertex disjoint equivalent subgraphs of order 3. Journal of Graph Theory 56(3): 159-166 (2007) |
| 2005 | ||
| 9 | EE | Tomoki Nakamigawa: One-dimensional Tilings Using Tiles with Two Gap Lengths. Graphs and Combinatorics 21(1): 97-105 (2005) |
| 2003 | ||
| 8 | Tomoki Nakamigawa: A Note on the Decomposition Dimension of Complete Graphs. Ars Comb. 69: (2003) | |
| 7 | EE | Tomoki Nakamigawa: A partition problem on colored sets. Discrete Mathematics 265(1-3): 405-410 (2003) |
| 2002 | ||
| 6 | EE | Hikoe Enomoto, Tomoki Nakamigawa: On the decomposition dimension of trees. Discrete Mathematics 252(1-3): 219-225 (2002) |
| 2001 | ||
| 5 | EE | Tomoki Nakamigawa: Nakade -- a graph theoretic concept in Go. Discrete Mathematics 235(1-3): 385-397 (2001) |
| 2000 | ||
| 4 | Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa: Induced Graph Theorem on Magic Valuations. Ars Comb. 56: (2000) | |
| 3 | EE | Tomoki Nakamigawa: A generalization of diagonal flips in a convex polygon. Theor. Comput. Sci. 235(2): 271-282 (2000) |
| 1998 | ||
| 2 | Tomoki Nakamigawa: One-Dimensional Tilings with Congruent Copies of a 3-Point Set. JCDCG 1998: 220-234 | |
| 1997 | ||
| 1 | EE | Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota: On the Pagenumber of Complete Bipartite Graphs. J. Comb. Theory, Ser. B 71(1): 111-120 (1997) |
| 1 | Hikoe Enomoto | [1] [4] [6] |
| 2 | Shinya Fujita | [13] |
| 3 | Hideo Ito | [11] |
| 4 | Kayo Masuda | [4] |
| 5 | Katsuhiro Ota | [1] |
| 6 | Toshinori Takabatake | [11] |