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

Finding Contents or People

A New Bound for Defining Numbers of Regular Graphs
Small oriented cycle double cover of graphs
On the oriented perfect path double cover conjecture
On the simultaneous edge coloring of graphs
On the 1-2-3-conjecture
Pairwise balanced designs and sigma clique partitions
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
Geometric modeling and dynamic analysis of cantilever beams for energy harvesting
Geometric modeling and dynamic analysis of cantilever beams for energy harvesting
Investigation of the static stable states of a bistable composite rectangular plate with curved fibers and piezoelectric layers
Discrete Stochastic Processes (Postgraduate Course)

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 321
  • Page 322
  • Page 323
  • Page 324
  • Page 325
  • Page 326
  • Page 327
  • Page 328
  • Page 329
  • …
  • 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

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