( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

, , , и . 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.

Toru Nomura

Toru Matsuyama

Toru Kashima

Richard Heinrich Torunsky

Ahmet Refah Torun

 

Другие публикации лиц с тем же именем

Independent Spanning Trees with Small Depths in Iterated Line Digraphs., и . CATS, том 20 из Australian Computer Science Communications, стр. 21-36. Springer-Verlag Singapore Pte. Ltd., (1998)Independent spanning cycle-rooted trees in the cartesian product of digraphs.. Electron. Notes Discret. Math., (2001)Structural Properties of Subdivided-Line Graphs.. IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 216-229. Springer, (2013)An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate., и . ISAAC, том 1533 из Lecture Notes in Computer Science, стр. 447-456. Springer, (1998)Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.. IWOCA, том 9538 из Lecture Notes in Computer Science, стр. 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, , , и . CoRR, (2009)The (p, q)-total Labeling Problem for Trees., , , и . ISAAC (2), том 6507 из Lecture Notes in Computer Science, стр. 49-60. Springer, (2010)A Linear Time Algorithm for L(2, 1)-Labeling of Trees., , , и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 35-46. Springer, (2009)An improved upper bound on the queuenumber of the hypercube., и . Inf. Process. Lett., 104 (2): 41-44 (2007)