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

Finding Contents or People

Distance Locating Sets in Graphs
On the Defining Numbers of Cartesian Product of Cycles
Chromatic Classes of Certain 2-Connected Graphs
Chromaticity of Generalised Polygon Trees
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 1-2-3-conjecture
Pairwise balanced designs and sigma clique partitions
Bounds on Some Variants of Clique Cover Numbers
Set Intersection Representations of Graphs
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 63
  • Page 64
  • Page 65
  • Page 66
  • Page 67
  • Page 68
  • Page 69
  • Page 70
  • Page 71
  • …
  • 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

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