( en | de | ru )

 

Disambiguation of "Hasunuma, Toru"

Author of the publication

copydeleteadd this publication to your clipboard
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

, , , and . CoRR, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Toru Nomura

Toru Matsuyama

Toru Kashima

Richard Heinrich Torunsky

Ahmet Refah Torun

 

Other publications of authors with the same name

Structural Properties of Subdivided-Line Graphs.. IWOCA, volume 8288 of Lecture Notes in Computer Science, page 216-229. Springer, (2013)Independent spanning cycle-rooted trees in the cartesian product of digraphs.. Electron. Notes Discret. Math., (2001)Independent Spanning Trees with Small Depths in Iterated Line Digraphs., and . CATS, volume 20 of Australian Computer Science Communications, page 21-36. Springer-Verlag Singapore Pte. Ltd., (1998)An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate., and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 447-456. Springer, (1998)Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.. IWOCA, volume 9538 of Lecture Notes in Computer Science, page 260-273. Springer, (2015)Structural properties of subdivided-line graphs.. J. Discrete Algorithms, (2015)A tight upper bound on the (2,1)-total labeling number of outerplanar graphs, , , and . CoRR, (2009)The (p, q)-total Labeling Problem for Trees., , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 49-60. Springer, (2010)A Linear Time Algorithm for L(2, 1)-Labeling of Trees., , , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 35-46. Springer, (2009)An improved upper bound on the queuenumber of the hypercube., and . Inf. Process. Lett., 104 (2): 41-44 (2007)