| Publication | Date of Publication | Type |
|---|
Representations of signed graphs
Journal of Algebraic Combinatorics | 2024-01-08 | Paper |
List strong edge-colorings of sparse graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2023-11-20 | Paper |
Strong list-chromatic index of planar graphs with Ore-degree at most seven
Graphs and Combinatorics | 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
Discrete Applied Mathematics | 2022-09-15 | Paper |
Some novel minimax results for perfect matchings of hexagonal systems
Discrete Applied Mathematics | 2022-08-24 | Paper |
Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
Discrete Mathematics | 2022-08-24 | Paper |
Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
(available as arXiv preprint) | 2021-11-15 | 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
Journal of Combinatorial Optimization | 2020-06-05 | Paper |
The strong edge-coloring for graphs with small edge weight
Discrete Mathematics | 2020-02-20 | Paper |
Triangle-roundedness in matroids
Discrete Mathematics | 2019-12-17 | Paper |
Recent progress on strong edge-coloring of graphs
Discrete Mathematics, Algorithms and Applications | 2019-11-07 | Paper |
DP-4-colorability of two classes of planar graphs
Discrete Mathematics | 2019-09-11 | Paper |
On critical circuits in \(k\)-connected matroids
Graphs and Combinatorics | 2019-01-11 | Paper |
Strong edge-coloring for planar graphs with large girth
Discrete Mathematics | 2018-11-29 | Paper |
On binary matroids without a \(P_{10}\)-minor
Graphs and Combinatorics | 2018-06-07 | Paper |
Clones in matroids representable over a prime field
Discrete Mathematics | 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
Discrete Mathematics | 2017-02-27 | Paper |
Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
Discrete Mathematics | 2016-06-20 | Paper |
A minimax result for perfect matchings of a polyomino graph
Discrete Applied Mathematics | 2016-05-02 | Paper |
A maximum resonant set of polyomino graphs
Discussiones Mathematicae Graph Theory | 2016-04-25 | Paper |
A new proof for a result of Kingan and Lemos'
Graphs and Combinatorics | 2016-03-02 | Paper |
Clones in 3-connected frame matroids
Discrete Mathematics | 2016-01-21 | Paper |
Unavoidable minors of large 4-connected bicircular matroids
Annals of Combinatorics | 2015-05-05 | Paper |
| On odd-gracefulness of all symmetric trees | 2014-03-12 | Paper |
Some properties of graceful graphs
Mathematics in Practice and Theory | 2013-11-19 | Paper |
Discussion of odd-graceful trees conjecture
Journal of Shandong University. Natural Science | 2013-11-19 | Paper |
Every lobster is odd-elegant
Information Processing Letters | 2013-03-21 | Paper |
Some minor-closed classes of signed graphs
Discrete Mathematics | 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
Journal of South China Normal University. Natural Science Edition | 2012-10-05 | Paper |
Generating an internally 4-connected binary matroid from another
Discrete Mathematics | 2012-08-10 | Paper |
Clonal sets in \(GF(q)\)-representable matroids
Discrete Mathematics | 2010-10-11 | Paper |
On minor-minimally 3-connected binary matroids
Discrete Mathematics | 2009-06-23 | Paper |
On clone sets of \(GF(q)\)-representable matroids
Discrete Mathematics | 2009-06-17 | Paper |
On minimally \(k\)-connected matroids
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
Generating weakly 4-connected matroids
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
A note on binary matroid with no \(M(K_{3,3})\)-minor
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
A Splitter Theorem for Internally 4‐Connected Binary Matroids
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
Distinguishability of locally finite trees
The Electronic Journal of Combinatorics | 2007-04-04 | Paper |
Distinguishability of locally finite trees
The Electronic Journal of Combinatorics | 2007-04-04 | Paper |
On internally 4-connected non-regular binary matroids
Journal of Combinatorial Theory. Series B | 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.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
