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

Finding Contents or People

Displaying 4921 - 4940 of 109827
4921 Edge clique covering sum of graphs Article
4922 Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks Article
4923 Some lower bounds for the L-intersection number of graphs Article
4924 An optimal traffic distribution method supporting end-to-end delay bound Article
4925 Pairwise balanced designs and sigma clique partitions Article
4926 Local clique covering of claw-free graphs Article
4927 On the 1-2-3-conjecture Article
4928 On the simultaneous edge coloring of graphs Article
4929 On the oriented perfect path double cover conjecture Article
4930 Small oriented cycle double cover of graphs Article
4931 Star coloring and tree-width of Kneser graph KG(n; 2) Article
4932 A New Bound for Defining Numbers of Regular Graphs Article
4933 Chromaticity of Generalised Polygon Trees Article
4934 Chromatic Classes of Certain 2-Connected Graphs Article
4935 On the Defining Numbers of Cartesian Product of Cycles Article
4936 Distance Locating Sets in Graphs Article
4937 Local Chromatic Number of Graphs Article
4938 On the b-Coloring of Some Special Graphs Article
4939 On the Dominating Coloring Article
4940 On the Total Restrained Domination Number Article

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 243
  • Page 244
  • Page 245
  • Page 246
  • Page 247
  • Page 248
  • Page 249
  • Page 250
  • Page 251
  • …
  • 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

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