| Publication | Date of Publication | Type |
|---|
| Representations of signed graphs | 2024-01-08 | Paper |
| List strong edge-colorings of sparse graphs | 2023-11-20 | Paper |
| Strong list-chromatic index of planar graphs with Ore-degree at most seven | 2023-10-31 | Paper |
| Ramsey Achievement Games on Graphs : Algorithms and Bounds | 2023-03-06 | Paper |
| The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs | 2022-09-15 | Paper |
| Some novel minimax results for perfect matchings of hexagonal systems | 2022-08-24 | Paper |
| Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels | 2022-08-24 | Paper |
| Forcing and anti-forcing polynomials of perfect matchings of a pyrene system | 2021-11-15 | Paper |
| The strong chromatic index of graphs with edge weight eight | 2020-06-05 | Paper |
| The strong edge-coloring for graphs with small edge weight | 2020-02-20 | Paper |
| Triangle-roundedness in matroids | 2019-12-17 | Paper |
| Recent progress on strong edge-coloring of graphs | 2019-11-07 | Paper |
| DP-4-colorability of two classes of planar graphs | 2019-09-11 | Paper |
| On critical circuits in \(k\)-connected matroids | 2019-01-11 | Paper |
| Strong edge-coloring for planar graphs with large girth | 2018-11-29 | Paper |
| On binary matroids without a \(P_{10}\)-minor | 2018-06-07 | Paper |
| Clones in matroids representable over a prime field | 2017-10-24 | Paper |
| Clar sets and maximum forcing numbers of hexagonal systems | 2017-07-19 | Paper |
| The strong chromatic index of \((3,\Delta)\)-bipartite graphs | 2017-02-27 | Paper |
| Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) | 2016-06-20 | Paper |
| A minimax result for perfect matchings of a polyomino graph | 2016-05-02 | Paper |
| A maximum resonant set of polyomino graphs | 2016-04-25 | Paper |
| A new proof for a result of Kingan and Lemos' | 2016-03-02 | Paper |
| Clones in 3-connected frame matroids | 2016-01-21 | Paper |
| Unavoidable minors of large 4-connected bicircular matroids | 2015-05-05 | Paper |
| On odd-gracefulness of all symmetric trees | 2014-03-12 | Paper |
| Some properties of graceful graphs | 2013-11-19 | Paper |
| Discussion of odd-graceful trees conjecture | 2013-11-19 | Paper |
| Every lobster is odd-elegant | 2013-03-21 | Paper |
| Some minor-closed classes of signed graphs | 2013-03-01 | Paper |
| Strongly graceful trees with perfect matchings and diameters not greater than 7 | 2013-01-24 | Paper |
| A proof to the odd-gracefulness of all lobsters. | 2012-12-19 | Paper |
| On 0-rotatable trees | 2012-10-05 | Paper |
| Generating an internally 4-connected binary matroid from another | 2012-08-10 | Paper |
| Clonal sets in \(GF(q)\)-representable matroids | 2010-10-11 | Paper |
| On minor-minimally 3-connected binary matroids | 2009-06-23 | Paper |
| On clone sets of \(GF(q)\)-representable matroids | 2009-06-17 | Paper |
| On minimally \(k\)-connected matroids | 2008-12-08 | Paper |
| Generating weakly 4-connected matroids | 2008-04-28 | Paper |
| A note on binary matroid with no \(M(K_{3,3})\)-minor | 2007-12-10 | Paper |
| A Splitter Theorem for Internally 4‐Connected Binary Matroids | 2007-09-06 | Paper |
| Distinguishability of locally finite trees | 2007-04-04 | Paper |
| On internally 4-connected non-regular binary matroids | 2004-08-06 | Paper |
| The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor. | 2004-03-15 | Paper |
