Star coloring and tree-width of Kneser graph KG(n; 2) |
March |
2017 |

Some lower bounds for the L-intersection number of graphs |
April |
2016 |

On the locating chromatic number of the cartesian product of graphs |
April |
2016 |

Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks |
April |
2016 |

On incidence coloring for some graphs of maximum degree 4 |
January |
2016 |

Edge clique covering sum of graphs |
February |
2016 |

Critical Hamiltonian connected graphs |
April |
2016 |

Local clique covering of claw-free graphs |
January |
2016 |

Pairwise balanced designs and sigma clique partitions |
January |
2016 |

Characterization of randomly k-dimensional graphs |
July |
2016 |

Small oriented cycle double cover of graphs |
January |
2016 |

Unique basis graphs |
October |
2016 |

On the 1-2-3-conjecture |
January |
2015 |

On the oriented perfect path double cover conjecture |
January |
2015 |

On the simultaneous edge coloring of graphs |
January |
2014 |

Characterization of n-vertex graphs with metric dimension n-3 |
January |
2014 |

An optimal traffic distribution method supporting end-to-end delay bound |
February |
2014 |

An upper bound for the total restrained domination number of graphs |
January |
2013 |

The impact of network topology on delay bound in wireless Ad Hoc networks |
January |
2013 |

Max-min total restrained domination number |
January |
2013 |

On the total restrained domination edge critical graphs |
January |
2013 |

On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q) |
January |
2012 |

On b-coloring of cartesian product of graphs |
January |
2012 |

The metric dimension of the lexicographic product of graphs |
November |
2012 |

On randomly k-dimentional graphs |
January |
2011 |

On the locating chromatic number of Kneser graphs |
January |
2011 |

On b-coloring of Kneser graphs |
January |
2009 |

Locally rainbow graphs |
January |
2009 |

Constructing regular graphs with smallest defining number |
January |
2009 |

On the local colorings of graphs |
January |
2008 |

Local coloring of the Kneser graphs |
January |
2008 |

On the defining sets of some special graphs |
January |
2006 |

Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria |
January |
2006 |

Chromatic equivalence classes of certain generalized polygon trees III |
January |
2003 |

Chromatic equivalence classes of certain generalized polygon trees II |
January |
2003 |

Chromatic equivalence classes of certain cycles with edges |
January |
2001 |