Average Edge-Connectivity of Cubic Graphs.
J. Interconnect. Networks, 2021
Paired-domination number of claw-free odd-regular graphs.
J. Comb. Optim., 2017
A -decomposition of tournaments and bipartite digraphs.
Discret. Appl. Math., 2017
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs.
Discret. Appl. Math., 2016
Disproof of the group coloring version of the Hadwiger conjecture.
Discret. Math. Algorithms Appl., 2014
Outer-connected domination in 2-connected cubic graphs.
Discret. Math. Algorithms Appl., 2014
Minimum degree, edge-connectivity and radius.
J. Comb. Optim., 2013
A Note on Semi-coloring of Graphs.
Graphs Comb., 2013
The Hyper-Wiener Index of the kth Power of a Graph.
Discret. Math. Algorithms Appl., 2011
A Conjecture on Average Distance and Diameter of a Graph.
Discret. Math. Algorithms Appl., 2011
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts.
Discret. Appl. Math., 2011
HajóS-like Theorem for Group Coloring.
Discret. Math. Algorithms Appl., 2010
Some results on the signless Laplacians of graphs.
Appl. Math. Lett., 2010
List linear arboricity of planar graphs.
Discuss. Math. Graph Theory, 2009
On perfect matchings of complements of line graphs.
Ars Comb., 2009
A Note on Edge Choosability and Degeneracy of Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2009
The Wiener index of the kth power of a graph.
Appl. Math. Lett., 2008
Hamiltonicity of complements of middle graphs.
Discret. Math., 2007