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

Finding Contents or People

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
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)
Small oriented cycle double cover of graphs
On the simultaneous edge coloring of graphs
Local clique covering of claw-free graphs
Some lower bounds for the L-intersection number of graphs
Edge clique covering sum of graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 134
  • Page 135
  • Page 136
  • Page 137
  • Page 138
  • Page 139
  • Page 140
  • Page 141
  • Page 142
  • …
  • 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

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