1 citations · 1 across the 4 of their papers we have counts for
4 papers
Mader's Conjecture and Its Variants for Cographs
Toru Hasunuma
The class of cographs is one of the most well-known graph classes, which is also known to be equivalent to the class of -free graphs. We show that Mader's conjecture is true i…
Completely Independent Spanning Trees in Line Graphs
Toru Hasunuma
Completely independent spanning trees in a graph are spanning trees of such that for any two distinct vertices of , the paths between them in the spanning trees are pair…
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1
A -total labeling of a graph is an assignment from the vertex set and the edge set to the set of nonnegative integers such that $|f(x)-…
A linear time algorithm for L(2,1)-labeling of trees
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1
An L(2,1)-labeling of a graph is an assignment from the vertex set to the set of nonnegative integers such that if and are adjacent and $|…