label: url

en: Completely independent spanning trees in line graphs

en: Graphs and Combinatorics

ja: Graphs and Combinatorics


en: Connectivity preserving trees in k-connected or k-edge-connected graphs

en: Journal of Graph Theory

ja: Journal of Graph Theory


en: Connectivity keeping trees in 2-connected graphs with girth conditions

en: Algorithmica

ja: Algorithmica


en: Connectivity keeping trees in 2-connected graphs


en: Structural properties of subdivided-line graphs

en: Journal of Discrete Algorithms

ja: Journal of Discrete Algorithms


en: A linear time algorithm for L(2,1)-labeling of trees


en: Completely independent spanning trees in torus networks

en: Networks

ja: Networks


en: On the (h,k)-domination numbers of iterated line digraphs

en: Discrete Applied Mathematics

ja: Discrete Applied Mathematics


en: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs


en: The (p,q)-total labeling problem for trees

en: Discrete Mathematics

ja: Discrete Mathematics


en: An O(n1.75) algorithm for L(2,1)-labeling of trees

en: Theoretical Computer Science

ja: Theoretical Computer Science


en: Improved book-embeddings of incomplete hypercubes


en: Queue layouts of iterated line directed graphs


en: On the number of cycles in generalized Kautz digraphs


en: Embedding iterated line digraphs in books


en: Independent spanning trees with small depths in iterated line digraphs


en: Completely independent spanning trees in the underlying graph of a line digraph


en: An efficient NC algorithm for a sparse k-edge-connectivity certificate

en: Journal of Algorithms

ja: Journal of Algorithms


en: Isomorphic factorization of de Bruijn digraphs


en: Embedding de Bruijn, Kautz and shuffle-exchange networks in books


en: Counting small cycles in generalized de Bruijn digraphs

en: Networks


en: Remarks on the placeability of isomorphic trees in a complete graph

en: Journal of Graph Theory


en: The number of labeled graphs placeable by a given permutation


en: An improved upper bound on the queuenumber of the hypercube

en: Information Processing Letters

ja: Information Processing Letters


en: On edge-disjoint spanning trees with small depths


en: Containment of butterflies in networks constructed by the line digraph operation