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

Finding Contents or People

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 Total Restrained Domination Number
On the Dominating Coloring
Local Chromatic Number of Graphs
Distance Locating Sets in Graphs
Chromatic Classes of Certain 2-Connected Graphs
On the oriented perfect path double cover conjecture
Some lower bounds for the L-intersection number of graphs
Bounds on Some Variants of Clique Cover Numbers
Graph Coloring: Various Types, Applications and Open Problems
Star Edge Coloring of Cactus Graphs
A Havel-Hakimi type problem for oriented graphs
Genetic evaluation of profitability measures in Holstein dairy cows

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 111
  • Page 112
  • Page 113
  • Page 114
  • Page 115
  • Page 116
  • Page 117
  • Page 118
  • Page 119
  • …
  • 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

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