Skip to main content
People
Isfahan University of Technology
Finding Contents or People
On the locating chromatic number of Kneser graphs
Constructing regular graphs with smallest defining number
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
Chromatic equivalence classes of certain cycles with edges
Locating Chromatic Number of Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
On the Total Restrained Domination Number
Local Chromatic Number of Graphs
On the Defining Numbers of Cartesian Product of Cycles
A New Bound for Defining Numbers of Regular Graphs
Small oriented cycle double cover of graphs
On the oriented perfect path double cover conjecture
Local clique covering of claw-free graphs
Some lower bounds for the L-intersection number of graphs
Bounds on Some Variants of Clique Cover Numbers
Pagination
First page
« First
Previous page
‹‹
…
Page
86
Page
87
Page
88
Page
89
Page
90
Page
91
Page
92
Page
93
Page
94
…
Next page
››
Last page
Last »
تحت نظارت وف بومی