Skip to main content
People
Isfahan University of Technology
Finding Contents or People
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
Chromatic equivalence classes of certain generalized polygon trees II
Chromatic equivalence classes of certain cycles with edges
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Pagination
First page
« First
Previous page
‹‹
…
Page
31
Page
32
Page
33
Page
34
Page
35
Page
36
Page
37
Page
38
Page
39
…
Next page
››
Last page
Last »
تحت نظارت وف بومی