Finding Contents or People

Critical Hamiltonian connected graphs
On the total restrained domination edge critical graphs
An upper bound for the total restrained domination number of graphs
On b-coloring of cartesian product of graphs
The metric dimension of the lexicographic product of graphs
On randomly k-dimentional graphs
On the locating chromatic number of Kneser graphs
On b-coloring of Kneser graphs
Locally rainbow graphs
Constructing regular graphs with smallest defining number
Local coloring of the Kneser graphs
On the local colorings of graphs
On the defining sets of some special graphs
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
Chromatic equivalence classes of certain generalized polygon trees III