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

Finding Contents or People

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
A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem
On the Star Coloring of Graphs
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
Star coloring and tree-width of Kneser graph KG(n; 2)

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 78
  • Page 79
  • Page 80
  • Page 81
  • Page 82
  • Page 83
  • Page 84
  • Page 85
  • Page 86
  • …
  • 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

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