| Publication | Date of Publication | Type |
|---|
| The Erdős-Gsyárfás conjecture holds for \(P_{10}\)-free graphs | 2024-09-27 | Paper |
| \(P_k\)-factors in squares and line graphs of trees | 2023-09-12 | Paper |
| Erd\H{o}s-Gy\'{a}rf\'{a}s Conjecture for $P_{10}$-free Graphs | 2023-08-10 | Paper |
| Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs | 2023-04-21 | Paper |
| \(P_3\)-factors in the square of a tree | 2021-03-17 | Paper |
| Bipancyclicism and bipanconnectivity in bipartite graphs | 2020-05-07 | Paper |
| Spanning 5-ended trees in \(K_{1,5}\)-free graphs | 2020-04-23 | Paper |
| On a spanning \(K\)-tree containing specified vertices in a graph | 2020-02-27 | Paper |
| Saturation Number for Linear Forest 2P3 ∪ tP2 | 2020-01-22 | Paper |
| Long cycles passing through vertices in k‐connected graphs | 2018-04-27 | Paper |
| Binding number, minimum degree and bipancyclism in bipartite graphs | 2017-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2992099 | 2016-08-10 | Paper |
| Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected | 2016-06-13 | Paper |
| Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs | 2016-05-23 | Paper |
| Weakly bipancyclic bipartite graphs | 2015-09-01 | Paper |
| Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs | 2014-12-02 | Paper |
| Degree Conditions for Spanning Brooms | 2014-11-17 | Paper |
| Degree conditions for spanning brooms | 2014-11-17 | Paper |
| Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs | 2014-02-14 | Paper |
| An optimal binding number condition for bipancyclism | 2013-09-26 | Paper |
| Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian | 2013-09-20 | Paper |
| On the ordering of trees by the two indices | 2012-10-10 | Paper |
| Endpoint extendable paths in dense graphs | 2012-08-10 | Paper |
| Circumferences of \(k\)-connected graphs involving independence numbers | 2011-10-12 | Paper |
| The influence of periodic perturbations on the Hopf bifurcation of a Liénard equation with bounded delay | 2011-09-29 | Paper |
| Cyclable cube of a graph | 2010-11-05 | Paper |
| Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs | 2010-09-20 | Paper |
| A weakly pancyclic theorem for Hamiltonian non-bipartite graphs | 2009-11-11 | Paper |
| Bicyclic graphs with exactly two main eigenvalues | 2009-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5320579 | 2009-07-22 | Paper |
| Removable matchings and Hamiltonian cycles | 2009-04-09 | Paper |
| A constructive characterization of total domination vertex critical graphs | 2009-04-09 | Paper |
| Weak cycle partition involving degree sum conditions | 2009-04-09 | Paper |
| On the graphic sequences which contain only two numbers appearing exactly twice respectively | 2008-08-06 | Paper |
| Linked graphs with restricted lengths | 2008-07-24 | Paper |
| Graph orientation and its total efficient domination | 2007-10-09 | Paper |
| Partition of a graph into cycles and vertices | 2007-04-26 | Paper |
| On the cyclabilitiy of some cube graphs | 2007-01-12 | Paper |
| Hamilton connectivity of line graphs and claw‐free graphs | 2005-11-07 | Paper |
| Perfect circular arc coloring | 2005-10-18 | Paper |
| Edge condition for a Hamiltonian bipartite graph to be bipancyclic | 2004-06-18 | Paper |
| On \(k\)-ordered graphs involved degree sum | 2004-02-08 | Paper |
| Long cycles through a linear forest | 2002-12-10 | Paper |
| Fan‐type theorem for path‐connectivity | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537192 | 2002-06-26 | Paper |
| A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity | 2000-01-11 | Paper |
| A strongly polynomial algorithm for the inverse shortest arborescence problem | 1998-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4887685 | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3764181 | 1987-01-01 | Paper |
