#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1992

2018

- This year (0)
- Last 5 years (5)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Toru Hasunuma
- Discrete Mathematics
- 2000

Abstract In this note, we define completely independent spanning trees. We say that T 1 , T 2 ,…, T k are completely independent spanning trees in a graph H if for any vertex r of H, they are… (More)

- Toru Hasunuma
- WG
- 2002

Let G be a graph. Let T1, T2, . . . , Tk be spanning trees in G. If for any two vertices u, v in G, the paths from u to v in T1, T2, . . . , Tk are pairwise openly disjoint, then we say that T1, T2,… (More)

- Toru Hasunuma, Misa Hirota
- Inf. Process. Lett.
- 2007

In this note, we show that the n-dimensional hypercube Q(n) can be laid out using n-2 queues for all n>=5. Our result improves the previously known result for the case n>=5.

- Toru Hasunuma, Hiroshi Nagamochi
- CATS
- 1998

We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line… (More)

- Toru Hasunuma, Chie Morisaka
- Networks
- 2012

Let T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk are completely… (More)

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
- SWAT
- 2008

An L(2,1)-labeling of a graph Gis an assignment ffrom the vertex set V(G) to the set of nonnegative integers such that |f(x) i¾? f(y)| i¾? 2 if xand yare adjacent and |f(x) i¾? f(y)| i¾? 1 if xand… (More)

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
- Algorithmica
- 2008

An L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of nonnegative integers such that |f(x)−f(y)|≥2 if x and y are adjacent and |f(x)−f(y)|≥1 if x and y are at… (More)

- Toru Hasunuma
- IWOCA
- 2015

Completely independent spanning trees \(T_1,T_2,\ldots ,T_k\) in a graph G are spanning trees in G such that for any pair of distinct vertices u and v, the k paths in the spanning trees between u and… (More)

- Toru Hasunuma
- Inf. Process. Lett.
- 2000

Let G be a graph with n vertices. Suppose that there are k edge-disjoint spanning trees in G . We show that if the minimum degree of the vertices in G is at least kl , then there are k edge-disjoint… (More)

- Toru Hasunuma
- IWOCA
- 2013

Motivated by self-similar structures of Sierpinski graphs, we newly introduce the subdivided-line graph operation Γ and define the n-iterated subdivided-line graph Γ n (G) of a graph G. We then study… (More)