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

Finding Contents or People

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 cycles with edges
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

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 144
  • Page 145
  • Page 146
  • Page 147
  • Page 148
  • Page 149
  • Page 150
  • Page 151
  • Page 152
  • …
  • 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

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