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

Finding Contents or People

On the b-Coloring of Some Special Graphs
Local Chromatic Number of Graphs
Distance Locating Sets in Graphs
Chromatic Classes of Certain 2-Connected Graphs
A New Bound for Defining Numbers of Regular Graphs
Some lower bounds for the L-intersection number of graphs
Edge clique covering sum of graphs
Bike Share Station Location using Graph Domination Set in Graphs
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
A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem
On the Star Coloring of Graphs

Pagination

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

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