| Publication | Date of Publication | Type |
|---|
Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs
Graphs and Combinatorics | 2025-01-13 | Paper |
Connectivity Preserving Hamiltonian Cycles in $k$-Connected Dirac Graphs
| 2023-12-05 | Paper |
Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
Journal of Graph Theory | 2023-10-06 | Paper |
Completely independent spanning trees in line graphs
Graphs and Combinatorics | 2023-08-21 | Paper |
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
| 2022-03-22 | Paper |
Connectivity keeping trees in 2-connected graphs with girth conditions
Algorithmica | 2021-09-02 | Paper |
Connectivity keeping trees in 2-connected graphs
Journal of Graph Theory | 2020-05-21 | Paper |
Constructions of universalized Sierpiński graphs based on labeling manipulations
| 2018-01-04 | Paper |
On edge-disjoint spanning trees with small depths
Information Processing Letters | 2016-06-16 | Paper |
Containment of butterflies in networks constructed by the line digraph operation
Information Processing Letters | 2016-06-01 | Paper |
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Structural properties of subdivided-line graphs
Journal of Discrete Algorithms | 2015-03-24 | Paper |
Structural properties of subdivided-line graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
A linear time algorithm for \(L(2,1)\)-labeling of trees
Algorithmica | 2013-06-25 | Paper |
Completely independent spanning trees in torus networks
Networks | 2012-11-15 | Paper |
A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
Journal of Discrete Algorithms | 2012-09-13 | Paper |
On the \((h,k)\)-domination numbers of iterated line digraphs
Discrete Applied Mathematics | 2012-08-14 | Paper |
The \((p,q)\)-total labeling problem for trees
Discrete Mathematics | 2012-03-29 | Paper |
Improved bounds for minimum fault-tolerant gossip graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
Lecture Notes in Computer Science | 2011-05-19 | Paper |
The (p,q)-total Labeling Problem for Trees
Algorithms and Computation | 2010-12-09 | Paper |
An improved upper bound on the queue number of the hypercube
Information Processing Letters | 2010-03-24 | Paper |
A Linear Time Algorithm for L(2,1)-Labeling of Trees
Lecture Notes in Computer Science | 2009-10-29 | Paper |
An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
Theoretical Computer Science | 2009-09-10 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Improved book-embeddings of incomplete hypercubes
Discrete Applied Mathematics | 2009-06-30 | Paper |
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Queue layouts of iterated line directed graphs
Discrete Applied Mathematics | 2007-06-08 | Paper |
On the number of cycles in generalized Kautz digraphs
Discrete Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2051080 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 1953097 (Why is no real title available?)
| 2003-07-25 | Paper |
Embedding iterated line digraphs in books
Networks | 2002-12-17 | Paper |
Completely independent spanning trees in the underlying graph of a line digraph
Discrete Mathematics | 2002-05-02 | Paper |
Independent spanning cycle-rooted trees in the Cartesian product of digraphs
| 2001-10-24 | Paper |
Completely independent spanning trees in the underlying graph of a line digraph
RIMS Kokyuroku | 2001-09-17 | Paper |
An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate
Journal of Algorithms | 2001-07-23 | Paper |
scientific article; zbMATH DE number 1507238 (Why is no real title available?)
| 2001-05-20 | Paper |
Independent spanning trees with small depths in iterated line digraphs
Discrete Applied Mathematics | 2001-01-01 | Paper |
Isomorphic factorization of de Bruijn digraphs
Discrete Mathematics | 2000-12-11 | Paper |
scientific article; zbMATH DE number 1444313 (Why is no real title available?)
| 2000-05-09 | Paper |
scientific article; zbMATH DE number 1303037 (Why is no real title available?)
| 1999-06-17 | Paper |
Embedding de Bruijn, Kautz and shuffle-exchange networks in books
Discrete Applied Mathematics | 1998-06-23 | Paper |
Counting small cycles in generalized de Bruijn digraphs
| 1997-07-23 | Paper |
Remarks on the placeability of isomorphic trees in a complete graph
| 1996-07-04 | Paper |
The number of labeled graphs placeable by a given permutation
| 1996-07-04 | Paper |
