![]() | ![]() |
| 2008 | ||
|---|---|---|
| 7 | Toru Kojima: Bandwidth of the corona of two graphs. Discrete Mathematics 308(17): 3770-3781 (2008) | |
| 6 | Toru Kojima: Bandwidth of the strong product of two connected graphs. Discrete Mathematics 308(7): 1282-1295 (2008) | |
| 2005 | ||
| 5 | Toru Kojima: Wide diameter and minimum length of disjoint Menger path systems. Networks 46(3): 136-141 (2005) | |
| 2003 | ||
| 4 | Toru Kojima: Bandwidth of the composition of two graphs. Discrete Mathematics 270(1-3): 298-308 (2003) | |
| 2002 | ||
| 3 | Toru Kojima, Kiyoshi Ando: Bandwidth of the cartesian product of two connected graphs. Discrete Mathematics 252(1-3): 227-235 (2002) | |
| 2001 | ||
| 2 | Toru Kojima, Kiyoshi Ando: Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. Ars Comb. 58: (2001) | |
| 2000 | ||
| 1 | Toru Kojima, Kiyoshi Ando: Wide-diameter and minimum length of fan. Theor. Comput. Sci. 235(2): 257-266 (2000) | |
| 1 | Kiyoshi Ando | [1] [2] [3] |
Data released under the ODC-BY 1.0 license — See also our legal information page