| Publication | Date of Publication | Type |
|---|
Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
Journal of Graph Theory | 2023-09-29 | Paper |
A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
Graphs and Combinatorics | 2023-07-19 | Paper |
Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
Discrete Mathematics | 2023-05-15 | Paper |
Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
Graphs and Combinatorics | 2022-01-03 | Paper |
Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter
Discussiones Mathematicae Graph Theory | 2021-02-10 | Paper |
| scientific article; zbMATH DE number 7225861 (Why is no real title available?) | 2020-07-29 | Paper |
| The structure of strong $k$-quasi-transitive digraphs with large diameters | 2020-06-11 | Paper |
A dominated pair condition for a digraph to be Hamiltonian
Discrete Mathematics | 2020-03-20 | Paper |
Critical kernel imperfect problem in generalizations of bipartite tournaments
Graphs and Combinatorics | 2019-06-28 | Paper |
A sufficient condition for a balanced bipartite digraph to be Hamiltonian
(available as arXiv preprint) | 2018-12-10 | Paper |
| A sufficient condition for a balanced bipartite digraph to be Hamiltonian | 2018-12-10 | Paper |
| An image retrieval method with sparse coding based on Riemannian manifold | 2018-01-29 | Paper |
| A note on cycles of maximum length in bipartite digraphs | 2017-11-29 | Paper |
| Orientations of 2-dimensional torus networks with only two in-degrees | 2017-10-20 | Paper |
| scientific article; zbMATH DE number 6770097 (Why is no real title available?) | 2017-09-06 | Paper |
Kings in strong tournaments.
Ars Combinatoria | 2016-10-26 | Paper |
Sharp lower bounds on signed domination numbers of digraphs.
Ars Combinatoria | 2016-10-05 | Paper |
Hamiltonian paths in \(k\)-quasi-transitive digraphs
Discrete Mathematics | 2016-05-18 | Paper |
\(k\)-kings in \(k\)-quasitransitive digraphs
Journal of Graph Theory | 2015-05-22 | Paper |
\((k-1)\)-kernels in strong \(k\)-transitive digraphs
Discussiones Mathematicae Graph Theory | 2015-05-11 | Paper |
| Cycles in 3-anti-circulant digraphs | 2015-01-14 | Paper |
\((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
Discrete Mathematics | 2014-11-07 | Paper |
A sufficient condition for graphs to be \(\lambda_k\)-optimal
Discrete Applied Mathematics | 2014-04-23 | Paper |
A conjecture on 3-anti-quasi-transitive digraphs
Discrete Mathematics | 2014-02-27 | Paper |
Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
Information and Computation | 2014-01-10 | Paper |
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
Discussiones Mathematicae. Graph Theory | 2013-11-11 | Paper |
A conjecture on \(k\)-transitive digraphs
Discrete Mathematics | 2012-03-29 | Paper |
Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
Information Sciences | 2011-06-22 | Paper |
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
Discrete Mathematics | 2011-02-18 | Paper |
Matching preclusion for \(k\)-ary \(n\)-cubes
Discrete Applied Mathematics | 2010-11-25 | Paper |
Kings in locally semicomplete digraphs
Journal of Graph Theory | 2010-04-22 | Paper |
The structure of strong arc-locally in-semicomplete digraphs
Discrete Mathematics | 2009-12-15 | Paper |
