| Publication | Date of Publication | Type |
|---|
On the inclusion chromatic index of a Halin graph
Discrete Mathematics | 2024-12-02 | Paper |
The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs
Discrete Applied Mathematics | 2022-09-15 | Paper |
The effect of vertex and edge deletion on the edge metric dimension of graphs
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
Injective edge coloring of generalized Petersen graphs
AIMS Mathematics | 2022-04-25 | 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 |
DP-4-colorability of two classes of planar graphs
Discrete Mathematics | 2019-09-11 | Paper |
On the \([1,2\)-domination number of generalized Petersen graphs]
Applied Mathematics and Computation | 2019-06-25 | Paper |
On tight bounds for the \(k\)-forcing number of a graph
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2019-06-17 | Paper |
Strong edge-coloring for planar graphs with large girth
Discrete Mathematics | 2018-11-29 | Paper |
Graphs with small total rainbow connection number
Frontiers of Mathematics in China | 2017-09-26 | Paper |
| The proper (vertex) connection numbers of cubic graphs | 2017-07-05 | Paper |
A solution to a conjecture on the generalized connectivity of graphs
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
Bicyclic graphs with maximal edge revised Szeged index
Discrete Applied Mathematics | 2016-10-07 | Paper |
| The total rainbow connection numbers of cubic graphs | 2016-07-20 | Paper |
Hardness results for total rainbow connection of graphs
Discussiones Mathematicae Graph Theory | 2016-04-25 | Paper |
The 3-rainbow index of a graph
Discussiones Mathematicae Graph Theory | 2015-03-04 | Paper |
Tricyclic graphs with maximal revised Szeged index
Discrete Applied Mathematics | 2014-09-08 | Paper |
The (revised) Szeged index and the Wiener index of a nonbipartite graph
European Journal of Combinatorics | 2014-03-25 | Paper |
Further hardness results on the rainbow vertex-connection number of graphs
Theoretical Computer Science | 2013-11-29 | Paper |
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
Graphs and Combinatorics | 2013-09-26 | Paper |
On a relation between Szeged and Wiener indices of bipartite graphs
Transactions on Combinatorics | 2013-07-10 | Paper |
| Further hardness results on the generalized connectivity of graphs | 2013-04-22 | Paper |
| On a relation between the Szeged index and the Wiener index for bipartite graphs | 2012-10-24 | Paper |
Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
Utilitas Mathematica | 2012-07-02 | Paper |
The complexity of determining the rainbow vertex-connection of a graph
Theoretical Computer Science | 2011-09-12 | Paper |
