| Publication | Date of Publication | Type |
|---|
Exploring Hamilton-connectedness in \(\{K_{1, 3}, \Gamma_0, P_{18} \}\)-free graphs
Discrete Applied Mathematics | 2025-11-04 | Paper |
Comprehensive review on twin support vector machines
Annals of Operations Research | 2024-09-10 | Paper |
Asymptotically sharpening the $s$-Hamiltonian index bound
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
Bounds on the connectivity of iterated line graphs
Electronic Journal of Graph Theory and Applications | 2022-11-29 | Paper |
| On \(s\)-fully cycle extendable line graphs | 2021-07-12 | Paper |
Essential edge connectivity of line graphs
Discrete Mathematics | 2018-10-23 | Paper |
The index problem of group connectivity
Journal of Combinatorics | 2017-07-25 | Paper |
\(K_5^-\)-factor in a graph.
Ars Combinatoria | 2016-10-06 | Paper |
On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
On \(s\)-Hamiltonian line graphs
Journal of Graph Theory | 2013-11-15 | Paper |
| scientific article; zbMATH DE number 6172648 (Why is no real title available?) | 2013-06-10 | Paper |
\(s\)-vertex pancyclic index
Graphs and Combinatorics | 2012-12-27 | Paper |
Spanning cycles in regular matroids without small cocircuits
European Journal of Combinatorics | 2012-09-12 | Paper |
Degree condition and \(Z_3\)-connectivity
Discrete Mathematics | 2012-05-30 | Paper |
| Regular matroids without disjoint circuits. | 2012-02-20 | Paper |
On 3-edge-connected supereulerian graphs
Graphs and Combinatorics | 2012-01-24 | Paper |
| Spanning eulerian subgraphs in \(N^2\)-locally connected claw-free graphs. | 2011-10-25 | Paper |
Obstructions to a binary matroid being graphic
European Journal of Combinatorics | 2011-08-09 | Paper |
Group connectivity and group colorings of graphs --- a survey
Acta Mathematica Sinica, English Series | 2011-04-06 | Paper |
Connectivity of iterated line graphs
Discrete Applied Mathematics | 2010-11-25 | Paper |
Degree sum condition for \(Z_{3}\)-connectivity in graphs
Discrete Mathematics | 2010-10-28 | Paper |
| Every 3-connected, essentially 11-connected line graph is Hamiltonian | 2010-07-30 | Paper |
Hamiltonian connectedness in 3-connected line graphs
Discrete Applied Mathematics | 2009-06-30 | Paper |
| A lower bound of the \(l\)-edge-connectivity and optimal graphs | 2009-04-14 | Paper |
Edge-connectivity and edge-disjoint spanning trees
Discrete Mathematics | 2009-04-09 | Paper |
On mod \((2p+1)\)-orientations of graphs
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
European Journal of Combinatorics | 2009-03-04 | Paper |
Degree sequence and supereulerian graphs
Discrete Mathematics | 2009-01-28 | Paper |
Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
Discrete Mathematics | 2009-01-27 | Paper |
On \(s\)-Hamiltonian-connected line graphs
Discrete Mathematics | 2008-09-04 | Paper |
The \(s\)-Hamiltonian index
Discrete Mathematics | 2008-09-04 | Paper |
Hamiltonian connected hourglass free line graphs
Discrete Mathematics | 2008-05-13 | Paper |
New sufficient condition for Hamiltonian graphs
Applied Mathematics Letters | 2007-12-06 | Paper |
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
European Journal of Combinatorics | 2007-11-30 | Paper |
| scientific article; zbMATH DE number 5184446 (Why is no real title available?) | 2007-08-29 | Paper |
| Spanning Eulerian subgraphs in claw-free graphs | 2007-07-30 | Paper |
Hamiltonicity in 3-connected claw-free graphs
Journal of Combinatorial Theory. Series B | 2006-07-12 | Paper |
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory. Series B | 2006-07-12 | Paper |
HamiltonianN2-locally connected claw-free graphs
Journal of Graph Theory | 2005-04-21 | Paper |
| scientific article; zbMATH DE number 1779632 (Why is no real title available?) | 2003-01-06 | Paper |
A sufficient condition for \(s\)-Hamilton-connected graphs
Journal of Nanjing Normal University. Natural Science Edition | 2002-09-11 | Paper |
