| Publication | Date of Publication | Type |
|---|
Length of cycles in generalized Petersen graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Convergence and correctness of belief propagation for weighted min-max flow
Discrete Applied Mathematics | 2024-06-20 | Paper |
Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs
Discrete Applied Mathematics | 2024-04-30 | Paper |
A survey on rainbow (vertex-)index of graphs
Discrete Applied Mathematics | 2024-04-02 | Paper |
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
Journal of Graph Theory | 2023-09-29 | Paper |
Remarks on component factors in K1,r-free graphs
RAIRO - Operations Research | 2023-05-26 | Paper |
Sufficient conditions for graphs with {P2, P5}-factors
RAIRO - Operations Research | 2022-09-15 | Paper |
Construction and Extension of Near-Homogeneous Tournaments
| 2022-09-14 | Paper |
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
The Hamiltonian properties in \(K_{1,r}\)-free split graphs
Discrete Mathematics | 2022-04-11 | Paper |
Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
RAIRO - Operations Research | 2022-02-21 | Paper |
The cubic graphs with finite cyclic vertex connectivity larger than girth
Discrete Mathematics | 2020-12-04 | Paper |
\(k\)-ary spanning trees contained in tournaments
Discrete Applied Mathematics | 2020-08-31 | Paper |
Approximation algorithm for a generalized Roman domination problem in unit ball graphs
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Extremal and degree conditions for path extendability in digraphs
SIAM Journal on Discrete Mathematics | 2017-09-18 | Paper |
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
International Journal of Computer Mathematics | 2017-07-28 | Paper |
On the complexity of edge-colored subgraph partitioning problems in network optimization
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-08-23 | Paper |
Bipartite double cover and perfect 2-matching covered graph with its algorithm
Frontiers of Mathematics in China | 2015-07-24 | Paper |
An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
Science China. Mathematics | 2015-03-26 | Paper |
Triangle strings: structures for augmentation of vertex-disjoint triangle sets
Information Processing Letters | 2014-04-30 | Paper |
Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Degree and connectivity conditions for IM-extendibility and vertex-deletable IM-extendibility.
| 2012-02-20 | Paper |
M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities
Discrete Mathematics | 2011-05-10 | Paper |
Construction characterizations for defect \(n\)-extendable bipartite graphs
AKCE International Journal of Graphs and Combinatorics | 2011-02-08 | Paper |
Notes on factor-criticality, extendibility and independence number
| 2011-02-02 | Paper |
Equivalence between extendability and factor-criticality
| 2011-02-02 | Paper |
Bipartite graphs with a perfect matching and digraphs
| 2009-08-17 | Paper |
A new image encryption scheme based on two-dimensional CA joint with CWQ method
| 2009-07-22 | Paper |
M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles
Discrete Mathematics | 2009-06-23 | Paper |
