activity
20082025
most citedA tight upper bound on the (2,1)-total labeling number of outerplanar graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

math.CO2022

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…