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 math.COShow all

2 papers · 1 filter

math.CO2025

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…

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…