Wide-diameter and minimum length of fan. - Toru Kojima; Kiyoshi Ando (Theor. Comput. Sci., 2000)

Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. - Toru Kojima; Kiyoshi Ando (Ars Comb., 2001)

Bandwidth of the cartesian product of two connected graphs. - Toru Kojima; Kiyoshi Ando (Discret. Math., 2002)

Bandwidth of the composition of two graphs. - Toru Kojima (Discret. Math., 2003)

Wide diameter and minimum length of disjoint Menger path systems. - Toru Kojima (Networks, 2005)

Bandwidth of the strong product of two connected graphs. - Toru Kojima (Discret. Math., 2008)

Bandwidth of the corona of two graphs. - Toru Kojima (Discret. Math., 2008)

On C4-supermagic labelings of the Cartesian product of paths and graphs. - Toru Kojima (Discret. Math., 2013)