Toru Hasunuma - Citegraph

Author Info

Name	Affiliation	Papers
TORU HASUNUMA	GUNMA UNIV,DEPT COMP SCI,KIRYU,GUMMA 376,JAPAN	32
Collaborators	Citations	PageRank
15	142	16.00
Referers	Referees	References
155	345	332

Search Limit

100345

Publications (32 rows)

Collaborators (15 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Connectivity Keeping Trees In 2-Connected Graphs With Girth Conditions	0	0.34	2021
Constructions of universalized Sierpiński graphs based on labeling manipulations.	0	0.34	2017
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.	7	0.54	2015
Algorithmic aspects of distance constrained labeling: a survey.	1	0.36	2014
Structural properties of subdivided-line graphs	0	0.34	2013
Completely independent spanning trees in torus networks	20	1.13	2012
On the (h, k)-domination numbers of iterated line digraphs.	1	0.37	2012
The (p,q)-total labeling problem for trees	1	0.36	2012
Improved bounds for minimum fault-tolerant gossip graphs	0	0.34	2011
The (2,1)-total labeling number of outerplanar graphs is at most Δ + 2	2	0.36	2010
An O(n1.75) algorithm for L(2,1)-labeling of trees	6	0.45	2009
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs	4	0.44	2009
Improved book-embeddings of incomplete hypercubes	1	0.34	2009
A Linear Time Algorithm for (2,1)-Labeling of Trees	0	0.34	2009
An Algorithm for L(2, 1)-Labeling of Trees	0	0.34	2008
An improved upper bound on the queuenumber of the hypercube	6	0.64	2007
Queue layouts of iterated line directed graphs	7	0.57	2007
Multilayer grid embeddings of iterated line digraphs	0	0.34	2006
On the number of cycles in generalized Kautz digraphs	4	0.45	2004
Embedding iterated line digraphs in books	7	0.59	2002
Completely Independent Spanning Trees in Maximal Planar Graphs	20	1.35	2002
Independent spanning cycle-rooted trees in the cartesian product of digraphs	0	0.34	2001
Completely independent spanning trees in the underlying graph of a line digraph	12	1.02	2001
On edge-disjoint spanning trees with small depths	5	0.46	2000
Isomorphic factorization of de Bruijn digraphs	1	0.41	2000
An efficient NC algorithm for a sparse k-edge-connectivity certificate	0	0.34	1998
Independent spanning trees with small depths in iterated line digraphs	20	0.92	1998
Containment of butterflies in networks constructed by the line digraph operation	2	0.43	1997
Counting small cycles in generalized de Bruijn digraphs	6	0.57	1997
Embedding de Bruijn, Kautz and shuffle-exchange networks in books	8	0.49	1997
The number of labeled graphs placeable by a given permutation	0	0.34	1996
Remarks on the placeability of isomorphic trees in a complete graph	1	0.37	1996