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

Finding Contents or People

Metric Dimension 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 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
Constructing regular graphs with smallest defining number
Local coloring of the Kneser graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 57
  • Page 58
  • Page 59
  • Page 60
  • Current page 61
  • Page 62
  • Page 63
  • Page 64
  • Page 65
  • …
  • 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

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