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

Finding Contents or People

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 oriented perfect path double cover conjecture
On the simultaneous edge coloring of graphs
Local clique covering of claw-free graphs
Pairwise balanced designs and sigma clique partitions
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

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 67
  • Page 68
  • Page 69
  • Page 70
  • Page 71
  • Page 72
  • Page 73
  • Page 74
  • Page 75
  • …
  • 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

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