Skip to main content
خانه
People
Isfahan University of Technology

Finding Contents or People

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
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Randomly Dimensional Graphs
Locating Chromatic Number of Graphs
Characterization of a Class of Hamiltonian Connected Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
On the Star Coloring of Graphs
On the b-Coloring of Some Special Graphs
Local Chromatic Number of Graphs
Distance Locating Sets in Graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 153
  • Page 154
  • Page 155
  • Page 156
  • Page 157
  • Page 158
  • Page 159
  • Page 160
  • Page 161
  • …
  • Next page ››
  • Last page Last »
Main navigation
  • Login
  • Manual
  • University Home Page
  • Home
  • Index

Provided by Information Technology Manager of Isfahan University of Technology (https://it.iut.ac.ir)

Support and send ticket

تحت نظارت وف بومی